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.*;
import java.math.*;
public class A{
    class Node implements Comparable<Node>  {

        int id;
        int l;
        int r;

        public Node(int id, int l,int r){
            this.l=l;
            this.r=r;
            this.id=id;



        }
        public int compareTo(Node c){
            int t =this.l/blocksize-c.l/blocksize;
            if(t!=0) return t;
            t=this.r-c.r;
            return t;
        }
    }
    void solve(){
         n=ni();
         while(blocksize*blocksize<n) blocksize++;
        int m=ni();
         a=new int[n+1];
        for(int i=1;i<=n;i++){
            a[i]=ni();

        }
        Node p[]=new Node[m+1];
        for(int i=1;i<=m;i++){
            int l=ni(),r=ni();
            p[i]=new Node(i,l,r);
        }
        Arrays.sort(p,1,m+1);
        cnt=new int[n+1];
        int l=1,r=1;
        add(1);
        int b[]=new int[m+1];
        for(int i=1;i<=m;i++){
             while(r+1<=p[i].r){
                 r++;
                 add(r);
             }
             while(r>p[i].r){
                 remove(r);
                 r--;
             }
             while(l<p[i].l){
                 remove(l);
                 l++;
             }
             while(l-1>=p[i].l){
                 l--;
                 add(l);
             }
             b[p[i].id]=ans;
        }
        for(int i=1;i<=m;i++) pw.println(b[i]);

    }
    static int blocksize=0;
    int ans=0;
    int cnt[];
    int a[];
    int n;
    void add(int x){
        if(a[x]>n) return;
        cnt[a[x]]++;
        if(cnt[a[x]]==a[x]) ans++;
        else if(cnt[a[x]]-1==a[x]) ans--;
    }
    void remove(int x){
        if(a[x]>n) return;
        cnt[a[x]]--;
        if(cnt[a[x]]==a[x]) ans++;
        else if(cnt[a[x]]+1==a[x]) ans--;
    }


    long M=(long)1e9+7;
    InputStream is;
    PrintWriter pw;
    String INPUT = "";
    void run() throws Exception {
        is = INPUT.isEmpty() ? System.in : new ByteArrayInputStream(INPUT.getBytes());
        pw = new PrintWriter(System.out);
        long s = System.currentTimeMillis();
        solve();
        pw.flush();
        if(!INPUT.isEmpty())tr(System.currentTimeMillis()-s+"ms");
    }

    public static void main(String[] args) throws Exception { new A().run(); }

    private byte[] inbuf = new byte[1024];
    public int lenbuf = 0, ptrbuf = 0;

    private int readByte() {
        if(lenbuf == -1)throw new InputMismatchException();
        if(ptrbuf >= lenbuf){
            ptrbuf = 0;
            try { lenbuf = is.read(inbuf); } catch (IOException e) { throw new InputMismatchException(); }
            if(lenbuf <= 0)return -1;
        }
        return inbuf[ptrbuf++];
    }

    private boolean isSpaceChar(int c) { return !(c >= 33 && c <= 126); }
    private int skip() { int b; while((b = readByte()) != -1 && isSpaceChar(b)); return b; }

    private double nd() { return Double.parseDouble(ns()); }
    private char nc() { return (char)skip(); }

    private String ns() {
        int b = skip();
        StringBuilder sb = new StringBuilder();
        while(!(isSpaceChar(b))){ // when nextLine, (isSpaceChar(b) && b != ' ')
            sb.appendCodePoint(b);
            b = readByte();
        }
        return sb.toString();
    }

    private char[] ns(int n) {
        char[] buf = new char[n];
        int b = skip(), p = 0;
        while(p < n && !(isSpaceChar(b))){
            buf[p++] = (char)b;
            b = readByte();
        }
        return n == p ? buf : Arrays.copyOf(buf, p);
    }

    private char[][] nm(int n, int m) {
        char[][] map = new char[n][];
        for(int i = 0;i < n;i++)map[i] = ns(m);
        return map;
    }

    private int[] na(int n) {
        int[] a = new int[n];
        for(int i = 0;i < n;i++)a[i] = ni();
        return a;
    }

    private int ni() {
        int num = 0, b;
        boolean minus = false;
        while((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-'));
        if(b == '-'){
            minus = true;
            b = readByte();
        }

        while(true){
            if(b >= '0' && b <= '9'){
                num = num * 10 + (b - '0');
            }else{
                return minus ? -num : num;
            }
            b = readByte();
        }
    }

    private long nl() {
        long num = 0;
        int b;
        boolean minus = false;
        while((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-'));
        if(b == '-'){
            minus = true;
            b = readByte();
        }

        while(true){
            if(b >= '0' && b <= '9'){
                num = num * 10 + (b - '0');
            }else{
                return minus ? -num : num;
            }
            b = readByte();
        }
    }

    private void tr(Object... o) { if(INPUT.length() > 0)System.out.println(Arrays.deepToString(o)); }
}