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

#include <bits/stdc++.h>
using namespace std;
#define int long long

signed main() {
    int n,q;cin>>n>>q;
    vector<int> v(n),mv(n);
    for(int i = 0;i<n;i++){
        cin>>v[i];
        mv[i]=v[i]*-1;
    }
    sort(v.begin(),v.end());
    sort(mv.begin(),mv.end());
    while(q--){
        int a,b;cin>>a>>b;
        int A=abs(a-b);
        int ans=upper_bound(mv.begin(),mv.end(),-1*(a+b))-upper_bound(v.begin(),v.end(),A)-1;
        cout<<max(ans,0LL)<<endl;
    }
}