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.*;
public class Main {

	public static void main(String[] args) {
		Scanner in=new Scanner(System.in);
		int n=in.nextInt(),m=in.nextInt();
		int[] a=new int[n];
		for(int i=0;i<n;i++)
			a[i]=in.nextInt();
		int[] mm=new int[100001];
		for(int i=0;i<n;i++)
			if(a[i]<=100000) mm[a[i]]++;
		int[] qu=new int[450];int le=0;
		for(int i=1;i<=100000;i++)
			if(mm[i]>=i) { qu[le]=i;le++; }
		int[] ans=new int[m];
		int[] l=new int[m],r=new int[m];
		for(int i=0;i<m;i++)
		{
			l[i]=in.nextInt();
			r[i]=in.nextInt();
		}
		int[] cnt=new int[n+1];
		for(int i=0;i<le;i++)
		{
			int count=0;
			for(int j=0;j<n;j++)
			{
				if(a[j]==qu[i]) count++;
				cnt[j+1]=count;
			}
			for(int j=0;j<m;j++)
			{
				if(cnt[r[j]]-cnt[l[j]-1]==qu[i])
					ans[j]++;
			}
		}
		for(int i=0;i<m;i++)
			System.out.println(ans[i]);
	}
}
			 	  	   	 						  		   	  	