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

using namespace std;

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

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

int main()
{
    cin >> N >> Q;
    for (i = 1; i <= N; ++i)
    {
        cin >> a;
        if (x.size() < a + 1) x.resize(a + 1);
        x[a] = 1;
    }

    int k = x.size() - 1;
    for (i = 1; i <= k; ++i)
        x[i] += x[i - 1];

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

    megold.resize(Q + 1, 0);

    for (i = 1; i <= Q; ++i)
    {
        megold[i] = x[min(y[i].second, k)] - x[y[i].first];
    }


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