// Source: https://usaco.guide/general/io

#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
	int n,q;
	cin>>n>>q;
	vector<int> a(n);
	for (int i = 0; i<n; i++) cin>>a[i];
	sort(a.begin(), a.end());

	while (q--){
		int b,c;
		cin>>b>>c;
		int mina=abs(b-c)+1, maxa=b+c-1, l=0, r=n, il=0, ir=n;

		while(il+1<r){
			int cur = (il+r)/2;
			if (a[cur]<=mina){
				il=cur;
				continue;
			}
			if (r==cur) {r--;break;}
			r=cur;
		}
		if (a[il]<mina) il++;

		while(l+1<ir){
			int cur = (l+ir)/2;
			if (a[cur]<=maxa){
				l=cur;
				continue;
			}
			if (ir==cur) {ir=il;break;}
			ir=cur;
		}
		if (a[il] > maxa){
			cout<<"0\n";
			continue;
		}
		//cout<<il<<" "<<ir<<"\n";
		cout<<ir-il<<"\n";
	}
}