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
// http://codeforces.com/contest/220/problem/B
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.HashMap;
import java.util.Scanner;

public class Mos {
	static int n, sqrt, ans;
	static HashMap<Integer, Integer> map;
	
	public static void main(String[] args) {
		Scanner in = new Scanner(System.in);
		n = in.nextInt();
		int q = in.nextInt();
		sqrt = (int) Math.sqrt(n);
		int[] arr = new int[n];
		for(int i = 0; i < n; i++)
			arr[i] = in.nextInt();
		
		int[] answers = new int[q];
		Query[] qs = new Query[q];
		for(int i = 0; i < q; i++)
			qs[i] = new Query(i, in.nextInt()-1, in.nextInt()-1);
		
		Arrays.sort(qs);
		ans = 0;
		
		// just first query
		int l = qs[0].lo, r = qs[0].hi;
		map = new HashMap<Integer, Integer>();
		for(int i = l; i <= r; i++)
			inc(arr[i]);
		answers[qs[0].i] = ans;
		
		// rest of queries
		for(int ind = 1; ind < q; ind++) {
			// adjust l
			while(l > qs[ind].lo)
				inc(arr[--l]);
			while(l < qs[ind].lo)
				dec(arr[l++]);
			
			//adjust r
			while(r < qs[ind].hi)
				inc(arr[++r]);
			while(r > qs[ind].hi)
				dec(arr[r--]);
			
			answers[qs[ind].i] = ans;
		}
		
		PrintWriter pw = new PrintWriter(System.out);
		for(int i = 0; i < q; i++) {
			pw.print(answers[i]);
			pw.append('\n');
		}
		pw.flush();
		pw.close();
	}
	
	static void inc(int key) {
		Integer count = map.get(key);
		if(count == null)
			count = 0;
		
		if(count++ == key)
			ans--;
		else if(count == key)
			ans++;
		
		map.put(key, count);
	}
	
	static void dec(int key) {
		Integer count = map.get(key);
		if(count == null)
			count = 0;
		
		if(count-- == key)
			ans--;
		else if(count == key)
			ans++;
		
		map.put(key, count);
	}
	
	static class Query implements Comparable<Query> {
		int i, lo, hi;
		
		public Query(int ind, int low, int high) {
			i = ind;
			lo = low;
			hi = high;
		}
		
		public int compareTo(Query rhs) {
			int cmp = lo/sqrt - rhs.lo/sqrt;
			if(cmp == 0)
				return hi - rhs.hi;
			
			return cmp;
		}
	}
}
