The Little Elephant loves playing with arrays. He has array a, consisting of n positive integers, indexed from 1 to n. Let's denote the number with index i as ai. 

Additionally the Little Elephant has m queries to the array, each query is characterised by a pair of integers lj and rj (1 ≤ lj ≤ rj ≤ n). For each query lj, rj the Little Elephant has to count, how many numbers x exist, such that number x occurs exactly x times among numbers alj, alj + 1, ..., arj.

Help the Little Elephant to count the answers to all queries.

Input

The first line contains two space-separated integers n and m (1 ≤ n, m ≤ 105) — the size of array a and the number of queries to it. The next line contains n space-separated positive integers a1, a2, ..., an (1 ≤ ai ≤ 109). Next m lines contain descriptions of queries, one per line. The j-th of these lines contains the description of the j-th query as two space-separated integers lj and rj (1 ≤ lj ≤ rj ≤ n).

Output

In m lines print m integers — the answers to the queries. The j-th line should contain the answer to the j-th query.

Examples

Input

7 2
3 1 2 2 3 3 7
1 7
3 4


Output

3
1
import java.util.*;
import java.io.*;

public class P220B
{
    public static void main(String[] args)
    {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        int m = sc.nextInt();
        int[] a = new int[n];
        int[] l = new int[m];
        int[] r = new int[m];
        ArrayList<Integer>[] numlist = new ArrayList[n + 1];
        ArrayList<Integer> master = new ArrayList<Integer>();
        for (int i = 0; i < n; i++)
        {
            a[i] = sc.nextInt();
            if (a[i] <= n)
            {
                if (numlist[a[i]] == null)
                {
                    numlist[a[i]] = new ArrayList<Integer>();
                }
                numlist[a[i]].add(i);
            }
        }
        for (int i = 1; i <= n; i++)
        {
            if (numlist[i] != null && numlist[i].size() >= i)
            {
                master.add(i);
            }
        }
        ArrayList<Trip> trips = new ArrayList<Trip>();
        for (int i = 0; i < m; i++)
        {
            l[i] = sc.nextInt() - 1;
            r[i] = sc.nextInt() - 1;
            Trip t = new Trip(l[i], r[i], i);
            trips.add(t);
        }
        int[] ans = new int[m];
        Collections.sort(trips);
        int[] pos = new int[n+1];
        Arrays.fill(pos, -1);
        int index = 0;
        for (int i = 0; i < n; i++)
        {
            if (a[i] <= n)
            {
                pos[a[i]]++;
            }
            while (index < trips.size() && trips.get(index).l == i)
            {
                Trip trip = trips.get(index);
                int sum = 0;
                for (int j = 0; j < master.size(); j++)
                {
                    int val = master.get(j);
                    List<Integer> list = numlist[val];
                    if (pos[val] == -1)
                    {
                        if (list.get(val - 1) <= trip.r && 
                                (list.size() <= val || list.get(val) > trip.r))
                        {
                            sum++;
                        }
                    }
                    else if (list.get(pos[val]) == i)
                    {
                        int ep = pos[val] + val - 1;
                        if (ep >= list.size())
                        {
                            continue;
                        }
                        if (list.get(ep) <= trip.r && 
                                (list.size() <= ep+1 || list.get(ep+1) > trip.r))
                        {
                            sum++;
                        }
                    }
                    else
                    {
                        int ep = pos[val] + val;
                        if (ep >= list.size())
                        {
                            continue;
                        }
                        if (list.get(ep) <= trip.r && 
                                (list.size() <= ep+1 || list.get(ep+1) > trip.r))
                        {
                            sum++;
                        }
                    }
                }
                ans[trip.pos] = sum;
                index++;
            }
        }
        
        for (int i = 0; i < ans.length; i++)
        {
            System.out.println(ans[i]);
        }
    }
    
    static class Trip implements Comparable<Trip>
    {
        int l, r, pos;
        public Trip(int l, int r, int pos)
        {
            this.l = l;
            this.r = r;
            this.pos = pos;
        }
        @Override
        public int compareTo(Trip t)
        {
            if (l == t.l) return r - t.r;
            else return l - t.l;
        }
    }
}
