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.ArrayList;
import java.util.Arrays;
import java.util.Comparator;
import java.util.LinkedList;
import java.util.List;
import java.util.StringTokenizer;

public class Main {

	private BufferedReader br;
	private StringTokenizer tokenizer;
	private PrintWriter pw;
	
	private void solve() throws IOException {
		int n = nextInt();
		int m = nextInt();
		int a[] = new int[n + 1];
		int l[] = new int[m];
		int r[] = new int[m];
		
		a[0] = 0;
		for (int i = 1; i <= n; ++i)
			a[i] = nextInt();
		
		for (int i = 0; i < m; ++i) {
			l[i] = nextInt();
			r[i] = nextInt();
		}
		
		int c[] = new int[100001];
		for (int i = 0; i <= n; ++i)
			if (a[i] <= 100000)
				++c[a[i]];
		
		int res[] = new int[m];
		for (int i = 1; i <= 100000; ++i) {
			if (c[i] < i)
				continue;
			
			int arr[] = new int[n + 1];
			arr[0] = 0;
			for (int j = 1; j <= n; ++j)
				arr[j] = arr[j - 1] + (a[j] == i ? 1 : 0);
			
			for (int j = 0; j < m; ++j)
				if (arr[r[j]] - arr[l[j]- 1] + 1 == i + 1)
					++res[j];
		}
		
		for (int i = 0; i < m; ++i)
			pw.println(res[i]);
	}
	
	public static void main(String[] args) {
		new Main().run();
	}

	public void run() {
		try {
			pw = new PrintWriter(System.out);
			br = new BufferedReader(new InputStreamReader(System.in));
			solve();
			pw.close();
			br.close();
		} catch (IOException e) {
			System.err.println("IO Error");
		}
	}

	int nextInt() throws IOException {
		return Integer.parseInt(nextToken());
	}

	long nextLong() throws IOException {
		return Long.parseLong(nextToken());
	}

	double nextDouble() throws IOException {
		return Double.parseDouble(nextToken());
	}

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

		return tokenizer.nextToken();
	}
}