#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
#define ll long long
int main()
{
    cin.tie(nullptr);
    cout.tie(nullptr);
    ios_base::sync_with_stdio(false);
    int n, q;
    cin >> n >> q;
    vector<ll>vec(n);
    for (size_t i = 0; i < n; i++) cin >> vec[i];
    sort(vec.begin(), vec.end());
    while (q--)
    {
        ll b, c;
        cin >> b >> c;
        auto l = lower_bound(vec.begin(), vec.end(), abs(c - b) + 1);
        auto r = upper_bound(l, vec.end(), b + c - 1);
        cout << r - l << endl;
    }
    return 0;
}