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.*;
import java.util.*;

public class Main {
	
	void solve() {
		int n = in.nextInt();
		int m = in.nextInt();
		int[] a = new int[n];
		int[] cnt = new int[n + 1];
		Arrays.fill(cnt, 0);
		for (int i = 0; i < n; ++i) {
			a[i] = in.nextInt();
			if (a[i] <= n) {
				++cnt[a[i]];
			}
		}
		int[] l = new int[m];
		int[] r = new int[m];
		for (int i = 0; i < m; ++i) {
			l[i] = in.nextInt();
			r[i] = in.nextInt();
		}
		int[] sum = new int[n + 1];
		int[] ans = new int[m];
		Arrays.fill(ans, 0);
		for (int i = 1; i <= n; ++i) {
			if (cnt[i] >= i) {
				sum[0] = 0;
				for (int j = 0; j < n; ++j) {
					sum[j + 1] = sum[j];
					if (a[j] == i) {
						sum[j + 1] += 1;
					}
				}
				for (int j = 0; j < m; ++j) {
					if (sum[r[j]] - sum[l[j] - 1] == i) {
						++ans[j];
					}
				}
			}
		}
		for (int i = 0; i < m; ++i) {
			out.println(ans[i]);
		}
	}
	
	void run() {
		in = new InputReader(System.in);
		out = new PrintWriter(System.out);
		solve();
		out.close();
	}
	
	InputReader in;
	PrintWriter out;
	
	class InputReader {
		BufferedReader br;
		StringTokenizer st;
		
		InputReader(InputStream is) {
			br = new BufferedReader(new InputStreamReader(is));
			st = null;
		}
		
		String next() {
			while (st == null || !st.hasMoreTokens()) {
				try {
					st = new StringTokenizer(br.readLine());
				} catch (IOException e) {
					throw new RuntimeException(e);
				}
			}
			return st.nextToken();
		}
		
		int nextInt() {
			return Integer.parseInt(next());
		}
	}
	
	public static void main(String[] args) {
		new Main().run();
	}
}