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

public class LittleElephantAndArray {

	static int BLOCK_SIZE;

	public static void main(String[] args) {
		Scanner scan = new Scanner(System.in);
		PrintWriter out = new PrintWriter(System.out);
		int n = scan.nextInt();
		int m = scan.nextInt();
		int[] arr = new int[n];
		for(int i = 0; i < n; i++) arr[i] = scan.nextInt();
		BLOCK_SIZE = (int)Math.sqrt(n);
		Query[] qarr = new Query[m];
		for(int i = 0; i < m; i++) qarr[i] = new Query(scan.nextInt()-1, scan.nextInt()-1, i);
		Arrays.sort(qarr);
		HashMap<Integer, Integer> freq = new HashMap<Integer, Integer>();
		int mo_left = 0;
		int mo_right = -1;
		int[] ans = new int[m];
		int curr = 0;
		for(int i = 0; i < m; i++) {
			Query q = qarr[i];
			while(mo_right < q.r) {
				mo_right++;
				int x = freq.getOrDefault(arr[mo_right], 0);
				if(x == arr[mo_right]) curr--;
				x++;
				if(x == arr[mo_right]) curr++;
				freq.put(arr[mo_right], x);
			}
			while(mo_right > q.r) {
				int x = freq.getOrDefault(arr[mo_right], 0);
				if(x == arr[mo_right]) curr--;
				x--;
				if(x == arr[mo_right]) curr++;
				freq.put(arr[mo_right], x);
				mo_right--;
			}
			while(mo_left > q.l) {
				mo_left--;
				int x = freq.getOrDefault(arr[mo_left], 0);
				if(x == arr[mo_left]) curr--;
				x++;
				if(x == arr[mo_left]) curr++;
				freq.put(arr[mo_left], x);
			}
			while(mo_left < q.l) {
				int x = freq.getOrDefault(arr[mo_left], 0);
				if(x == arr[mo_left]) curr--;
				x--;
				if(x == arr[mo_left]) curr++;
				freq.put(arr[mo_left], x);
				mo_left++;
			}
			ans[q.i] = curr;
		}
		for(int i = 0; i < m; i++) {
			out.println(ans[i]);
		}
		out.flush();
	}

	static class Query implements Comparable<Query>{

		int l;
		int r;
		int i;

		public Query(int l, int r, int i) {
			this.l = l;
			this.r = r;
			this.i = i;
		}

		@Override
		public int compareTo(Query arg0) {
			if(l/BLOCK_SIZE == arg0.l/BLOCK_SIZE) return this.r-arg0.r;
			return l/BLOCK_SIZE-arg0.l/BLOCK_SIZE;
		}
	}
}
