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.awt.*;
import java.awt.geom.*;
import java.io.*;
import java.math.*;
import java.text.*;
import java.util.*;

/*
br = new BufferedReader(new FileReader("input.txt"));
pw = new PrintWriter(new BufferedWriter(new FileWriter("output.txt")));
br = new BufferedReader(new InputStreamReader(System.in));
pw = new PrintWriter(new BufferedWriter(new OutputStreamWriter(System.out)));
 */

public class Main {
	private static BufferedReader br;
	private static StringTokenizer st;
	private static PrintWriter pw;

	public static void main(String[] args) throws IOException	{
		br = new BufferedReader(new InputStreamReader(System.in));
		pw = new PrintWriter(new BufferedWriter(new OutputStreamWriter(System.out)));
		HashMap<Integer, Integer> map = new HashMap<Integer, Integer>();
		int n = readInt();
		int qq = readInt();
		int[] list = new int[n];
		int[] count = new int[n+1];
		for(int i = 0; i < n; i++)	{
			list[i] = readInt();
			if(list[i] <= n)
				count[list[i]]++;
		}
		int[] l = new int[qq];
		int[] r = new int[qq];
		for(int i = 0; i < qq; i++)	{
			l[i] = readInt();
			r[i] = readInt();
		}
		int[] ret = new int[qq];
		for(int curr = 1; curr <= n; curr++)	{
			if(count[curr] >= curr)	{
				int[] seen = new int[n+1];
				for(int i = 0; i < n; i++)	{
					seen[i+1] = seen[i];
					if(list[i] == curr)
						seen[i+1]++;
				}
				for(int i = 0; i < qq; i++)		{
					if(seen[r[i]] - seen[l[i]-1] == curr)
						ret[i]++;
				}
			}
		}
		for(int out: ret)
			pw.println(out);
		pw.close(); 
	}

	public static int findMax(ArrayList<Integer> list, int want)	{
		int min = 0;
		int max = list.size()-1;
		while(min <= max)	{
			int mid = (min+max)/2;
			if(list.get(mid) == want)
				return mid;
			if(list.get(mid) > want)
				max = mid-1;
			else
				min = mid+1;
		}
		return max;
	}

	public static int findMin(ArrayList<Integer> list, int want)	{
		int min = 0;
		int max = list.size()-1;
		while(min <= max)	{
			int mid = (min+max)/2;
			if(list.get(mid) == want)
				return mid;
			if(list.get(mid) < want)
				min = mid+1;
			else
				max = mid-1;
		}
		return min;
	}

	/* NOTEBOOK CODE */

	public static void loadArray(int[][] grid) throws IOException {
		for(int[] a: grid)
			loadArray(a);
	}

	public static void loadArray(int[] in) throws IOException {
		for(int i = 0; i < in.length; i++)
			in[i] = readInt();
	}

	public static void loadArray(long[] in) throws IOException {
		for(int i = 0; i < in.length; i++)
			in[i] = readLong();
	}


	private static long readLong() throws IOException	{
		return Long.parseLong(nextToken());
	}

	private static double readDouble() throws IOException	{
		return Double.parseDouble(nextToken());
	}

	private static int readInt() throws IOException	{
		return Integer.parseInt(nextToken());
	}

	private static String nextToken() throws IOException	{
		while(st == null || !st.hasMoreTokens())	{
			if(!br.ready())	{
				pw.close();
				System.exit(0);
			}
			st = new StringTokenizer(br.readLine().trim());
		}
		return st.nextToken();
	}
}