#include <iostream>
#include <vector>
#include <algorithm>
#include <string>
#include <set>
#include <cmath>
#include <map>
#include <unordered_set>
#include <unordered_map>


using namespace std;

int main()
{
    ios::sync_with_stdio(false); cin.tie(0);    
    int n, q;
    cin >> n >> q;
    vector<int> lines(n, 0);

    for (int i = 0; i < n; i++) {
        int s; cin >> s;
        lines[i] = s;
    }

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

    for (int k = 0; k < q; k++)
    {
        int a, b;
        cin >> a >> b;
        if (a > b) {
            int temp = a;
            a = b;
            b = temp;
        }
        
        int sum = 0;
        for (int i = 0; i < n; i++) {
            if (lines[i] + a > b && lines[i] + b > a && a + b > lines[i]) {
                sum++;
            }
        }
        cout << sum << '\n';
    }
}