#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;

int bs(int target,vector<int> &a)
{
int l=0;
int r=a.size()-1;
int ans=0;
while(l<=r)
    {
    int m=(l+r)/2;
    if(a[m]==target)return m+1;
    if(a[m]<target)r=m-1;
    else {l=m+1;ans=m;}
    }
return ans+1;
}
int bs1(int target,vector<int> &a)
{
int l=0;
int r=a.size()-1;
int ans=-1;
while(l<=r)
    {
    int m=(l+r)/2;
    if(a[m]==target)return m+1;
    if(a[m]<target){r=m-1;}
    else {l=m+1;ans=m;}
    //cout<<m<<" "<<l<<" "<<r<<" "<<ans<<"\n";
    }
return ans+1;
}
int main()
{
    int n,q;
    cin>>n>>q;
    vector<int> a(n);
    for(int &x:a)cin>>x;
    sort(a.begin(),a.end(),greater<int>());
    int x,y;
    for(int i=0;i<q;i++)
        {
        cin>>x>>y;
        cout<<bs(max(x,y)-min(x,y),a)-bs1(x+y,a)<<"\n";
        }
    return 0;
}