#include <bits/stdc++.h>
using namespace std;
#define f(i,k,n) for(int i=k; i<n; i++)
#define ll long long
const int inf = INT_MAX;

void solve()
{
    int n,q;
    cin>>n>>q;
    vector<int> a(n);
    f(i,0,n)    cin>>a[i];
    sort(a.begin(),a.end());
    int x,y;
    f(i,0,q)
    {
        cin>>x>>y;
        cout<<lower_bound(a.begin(),a.end(),x+y)-lower_bound(a.begin(),a.end(),abs(x-y)+1)<<"\n";
    }
}

int main()
{
    ios::sync_with_stdio(0);
    cin.tie(0);
    int t=1;
    //cin>>t;
    while(t--)  solve();
    return 0;
}