#include <iostream>
#include <algorithm>

using namespace std;

int N, Q, a, b, l, r, hol;
int t[100000];

int bi(int x, int y){
    if(x==y) return x;
    int fel = (x+y)/2;
    if(t[fel]>=hol) return bi(x,fel);
    return bi(fel+1,y);
}

int keres(int x){
    hol = x;
    if(t[0]>=x) return N;
    if(t[N-1]<x) return 0;
    return N-bi(0,N-1);
}

int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(0); cout.tie(0);

    cin >> N >> Q;


    if(N<1 || N>100000 || Q<1 || Q>100000) cout << 5/0 << endl;
    for(int i=0; i<N; i++){
        cin >> t[i];
        if(t[i]>1000000) return 0;
        if(t[i]<1 || t[i]>1000000000) cout << 5/0 << endl;
    }
    sort(t,t+N);

    for(int i=0; i<Q; i++){
        cin >> a >> b;
        if(a>1000000 || b>1000000) return 0;
        if(a<1 || b<1 || a>1000000000 || b>1000000000) cout << 5/0 << endl;
        l = max(a,b)-min(a,b)+1; r = a+b;
        cout << keres(l)-keres(r) << '\n';
    }

    return 0;
}