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.io.BufferedReader;
import java.io.IOException;
import java.io.InputStream;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.HashSet;
import java.util.StringTokenizer;

public class LittleElephantAndArray
{
	public static void main(String[] args) throws IOException
	{
		Scanner sc = new Scanner(System.in);
		PrintWriter pw = new PrintWriter(System.out);
		int n = sc.nextInt();
		int q = sc.nextInt();
		int[] arr = new int[n];
		int[] cnt = new int[100005];
		for (int i = 0; i < arr.length; i++)
		{
			arr[i] = sc.nextInt();
			if(arr[i] <= n)
				cnt[arr[i]]++;
		}
		HashSet<Integer> imp = new HashSet<Integer>();
		int r = 0, rnk[] = new int[n+5];
		for (int i = 1; i < cnt.length; i++)
			if(cnt[i] >= i)
			{
				imp.add(i);
				rnk[i] = r++;
			}
		
		int cntImp = imp.size();
		int[][] cum = new int[cntImp][n+1];
		for (int i = 0; i < arr.length; i++)
			if(imp.contains(arr[i]))
				cum[rnk[arr[i]]][i+1]++;
		
		for(int[] array: cum)
			for (int i = 1; i < array.length; i++)
				array[i] += array[i-1];
		
		for (int i = 0; i < q; i++)
		{
			int f = sc.nextInt();
			int t = sc.nextInt();
			int ans = 0;
			for (int candidate : imp)
			{
				int occ = cum[rnk[candidate]][t] - cum[rnk[candidate]][f-1];
				if(occ == candidate)
					ans++;
			}
			pw.println(ans);
		}
		pw.flush();
		pw.close();
	}
	
	static class Scanner 
	{
		StringTokenizer st; BufferedReader br;
		public Scanner(InputStream s)
		{
			br = new BufferedReader(new InputStreamReader(s));
		}
		public String next() throws IOException
		{
			while (st == null || !st.hasMoreTokens()) 
			st = new StringTokenizer(br.readLine());
			return st.nextToken();
		}
		public int nextInt() throws IOException {return Integer.parseInt(next());}
		public long nextLong() throws IOException {return Long.parseLong(next());}
		public String nextLine() throws IOException {return br.readLine();}
		public boolean ready() throws IOException {return br.ready();}
	}
}
