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 Main {

	BufferedReader in;
	StringTokenizer str = null;
	PrintWriter out;
	
	private String next() throws Exception{
		while (str == null || !str.hasMoreElements())
			str = new StringTokenizer(in.readLine());
		return str.nextToken();
	}
	
	private int nextInt() throws Exception{
		return Integer.parseInt(next());
	}
	
	private long nextLong() throws Exception{
		return Long.parseLong(next());
	}
	
	private double nextDouble() throws Exception{
		return Double.parseDouble(next());
	}

	final long oo = Long.MAX_VALUE;
	
	public void run() throws Exception{
		in =  new BufferedReader(new InputStreamReader(System.in));
		out = new PrintWriter(System.out);
		int n = nextInt(), m = nextInt();
		int []a = new int[n];
		for(int i = 0; i < n; ++i) a[i] = nextInt();
		int []count = new int[n + 1];
		for(int i = 0; i < n; ++i) {
			if (a[i] <= n) {
				++count[a[i]];
			}
		}
		int []set = new int[500];
		int size = 0;
		for(int i = 1; i <= n; ++i) {
			if (count[i] >= i) {
				set[size++] = i;
			}
		}
		int []l = new int[m];
		int []r = new int[m];
		int []ans = new int[m];
		for(int i = 0; i < m; ++i) {
			l[i] = nextInt() - 1;
			r[i] = nextInt() - 1;
		}
		for(int i = 0; i < size; ++i) {
			int []sum = new int[n];
			for(int j = 0; j < n; ++j) {
				if (j > 0) sum[j] = sum[j-1];
				if (set[i] == a[j]) ++sum[j];
			}
			int ret = 0;
			for(int j = 0; j < m; ++j) {
				int left = l[j], right = r[j];
				int s = sum[right];
				if (left > 0) s-= sum[left - 1];
				if (s == set[i]) ++ans[j];
			}
		}
		for(int i : ans) {
			out.println(i);
		}
		out.close();
	}

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