#include<stdio.h>
#include<algorithm>
#include<set>
using namespace std;
set<pair<int, int>>S;
int a[121212];
int main() {
	int n, q, i;
	scanf("%d%d", &n, &q);
	for (i = 0; i < n; i++)scanf("%d", &a[i]);
	sort(a, a + n);
	for (i = 0; i < n; i++)S.insert({ a[i],i });
	S.insert({ 1e9 + 1,n });
	for (i = 0; i < q; i++) {
		int s, e;
		scanf("%d%d", &s, &e);
		printf("%d\n", S.lower_bound({ e + 1,-1 })->second - S.lower_bound({ s,-1 })->second);
	}
	return 0;
}

I2luY2x1ZGU8c3RkaW8uaD4KI2luY2x1ZGU8YWxnb3JpdGhtPgojaW5jbHVkZTxzZXQ+CnVzaW5nIG5hbWVzcGFjZSBzdGQ7CnNldDxwYWlyPGludCwgaW50Pj5TOwppbnQgYVsxMjEyMTJdOwppbnQgbWFpbigpIHsKCWludCBuLCBxLCBpOwoJc2NhbmYoIiVkJWQiLCAmbiwgJnEpOwoJZm9yIChpID0gMDsgaSA8IG47IGkrKylzY2FuZigiJWQiLCAmYVtpXSk7Cglzb3J0KGEsIGEgKyBuKTsKCWZvciAoaSA9IDA7IGkgPCBuOyBpKyspUy5pbnNlcnQoeyBhW2ldLGkgfSk7CglTLmluc2VydCh7IDFlOSArIDEsbiB9KTsKCWZvciAoaSA9IDA7IGkgPCBxOyBpKyspIHsKCQlpbnQgcywgZTsKCQlzY2FuZigiJWQlZCIsICZzLCAmZSk7CgkJcHJpbnRmKCIlZFxuIiwgUy5sb3dlcl9ib3VuZCh7IGUgKyAxLC0xIH0pLT5zZWNvbmQgLSBTLmxvd2VyX2JvdW5kKHsgcywtMSB9KS0+c2Vjb25kKTsKCX0KCXJldHVybiAwOwp9

NCA2CjMgMiA3IDUKMiAzCjIgNAoyIDUKMiA3CjQgNgo4IDEw

4 6
3 2 7 5
2 3
2 4
2 5
2 7
4 6
8 10