#include <iostream>
#include <vector>
#include <algorithm>
#include <queue>
#include <climits>

using namespace std;
signed main()
{
	int n, m;
	cin >> n >> m;
	vector<int> lenghts(n);
	for (size_t i = 0; i < n; i++)
	{
		cin >> lenghts[i];
	}
	sort(lenghts.begin(), lenghts.end());
	for (size_t i = 0; i < m; i++)
	{
		int a, b;
		cin >> a >> b;
		int res1 = 0;
		if (lenghts[0] <= abs(a - b)) {
			res1 = upper_bound(lenghts.begin(), lenghts.end(), abs(a - b))-lenghts.begin();
		}
		int res2 = lenghts.size();
		if (lenghts[lenghts.size() - 1] >= a + b) {
			res2 = lower_bound(lenghts.begin(), lenghts.end(), abs(a + b)) - lenghts.begin();
		}
		cout << res2 - res1 << "\n";
	}
}