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
from collections import defaultdict
import sys

count=0
def add(freq,arr,i):
    freq[arr[i]]+=1
    global count
    if freq[arr[i]]==arr[i]:
        count+=1
    elif freq[arr[i]]==arr[i]+1:
        count-=1

def remove(freq,arr,i):
    freq[arr[i]]-=1
    global count
    if freq[arr[i]]==arr[i]-1:
        count-=1
    elif freq[arr[i]]==arr[i]:
        count+=1

def mo_algo(Q,arr):
    blk_size=750
    start,end=0,-1
    freq=defaultdict(int)

    ans={}
    for l,r in sorted(Q,key=lambda x:(x[0]//blk_size,x[1])):
        while start>l:
            start-=1
            add(freq,arr,start)
        while end<r:
            end+=1
            add(freq,arr,end)
        while start<l:
            remove(freq,arr,start)
            start+=1
        while end>r:
            remove(freq,arr,end)
            end-=1         
        ans[(l,r)]=count

    res=[]
    for l,r in Q:
        res.append(ans[(l,r)])
    return res

input=sys.stdin.readline
def main():
    n,q=map(int,input().split())
    arr=list(map(int,input().split()))

    Q=[]
    for i in range(q):
        l,r=map(int,input().split())
        Q.append((l-1,r-1))
    
    ans=mo_algo(Q,arr)
    for a in ans:
        sys.stdout.write(str(a)+'\n')

main()