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.InputStreamReader;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.HashMap;
import java.util.StringTokenizer;


public class E {

	public static void main(String[] args) throws NumberFormatException, IOException {
		Scanner sc = new Scanner();
		PrintWriter out = new PrintWriter(System.out);
		int n = sc.nextInt(), m = sc.nextInt();
		int [] a = new int[n];
		for (int i = 0; i < a.length; ++i) {
			a[i] = sc.nextInt();
		}
		Query [] queries = new Query[m];
		for (int i = 0; i < m; ++i) {
			queries[i] = new Query(sc.nextInt()-1, sc.nextInt()-1, i);
		}
		cnt = new HashMap<>();
		int [] res = mo(a, queries);
		for(int i:res)
			out.println(i);
		out.close();
	}
	// Queries: Given L and R, find the number of distinct values in [L, R]
	static int ans;				// answer of the current range
	static HashMap<Integer, Integer> cnt;			

	static void add(int val)
	{
		int count = cnt.getOrDefault(val, 0)+1;
		cnt.put(val, count);
		if(count == val)	//val occurs val times
			++ans;
		if(count-1 == val)
			--ans;
	}

	static void remove(int val)
	{
		int count = cnt.getOrDefault(val, 0);
		if(count > 1)
			cnt.put(val, count-1);
		else cnt.remove(val);
		if(count == val)	//val did occur val times
			--ans;
		if(count-1 == val)
			++ans;
	}

	static int[] mo(int[] a, Query[] queries)
	{
		Query.s = (int) Math.ceil(Math.sqrt(a.length));
		Arrays.sort(queries);

		int L = 0, R = -1, res[] = new int[queries.length];
		for(Query q: queries)
		{
			while(R < q.right) add(a[++R]);
			while(L > q.left)  add(a[--L]);
			while(L < q.left)  remove(a[L++]);
			while(R > q.right) remove(a[R--]);
			res[q.idx] = ans;
		}
		return res;
	}

	static class Query implements Comparable<Query>
	{
		static int s;				// length of a block , s = sqrt(n)					
		int left, right, idx;

		Query(int a, int b, int c)
		{
			left = a; right = b; idx = c;
		}

		public int compareTo(Query q)
		{
			if(left / s != q.left / s)
				return left / s - q.left / s;
			return right - q.right;
		}	
	}
	static class Scanner {
		BufferedReader br;
		StringTokenizer st;

		public Scanner() {
			br = new BufferedReader(new InputStreamReader(System.in));
		}

		public String next() throws IOException {
			while (st == null || !st.hasMoreTokens()) {
				st = new StringTokenizer(br.readLine());
			}
			return st.nextToken();
		}

		public int nextInt() throws NumberFormatException, IOException {
			return Integer.parseInt(next());
		}
		public long nextLong() throws NumberFormatException, IOException {
			return Long.parseLong(next());
		}
	}

}
