#include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>

#define ll long long
using namespace std;

//ifstream cin("harom.in");
//ofstream cout("harom.out");

vector <ll> megold, x;
vector <pair<ll, ll> > y;
ll N, Q, a, b, i, j;

int main()
{
    cin >> N >> Q;
    x.resize(N);

    for (i = 0; i < N; ++i)
        cin >> x[i];

    sort(x.begin(), x.end());

    ll k = x.back();
    //x.push_back(k + 1);

    y.push_back({ 0,0 });
    for (i = 1; i <= Q; ++i)
    {
        cin >> a >> b;
        y.push_back({ abs(b - a) + 1, min(a + b - 1,k) });
    }

    megold.resize(Q + 1, 0);

    vector <ll>::iterator it1, it2;
    ll ind1, ind2;

    for (i = 1; i <= Q; ++i)
    {
        it1 = lower_bound(x.begin(), x.end(), y[i].first);
        it2 = lower_bound(x.begin(), x.end(), y[i].second);
        if (*it2 > y[i].second) --it2;
        
        ind1 = it1 - x.begin();
        ind2 = it2 - x.begin();
         
        megold[i] = ind2 - ind1 + 1;
    }

    for (i = 1; i <= Q; ++i)
        cout << megold[i] << '\n';
    return 0;
}