#include <bits/stdc++.h>

using namespace std;
using ll = long long int;
const ll inf = 1e9;

int main()
{
  int n, q;
  cin >> n >> q;
  vector<int> v(n);
  for(auto& i : v){
    cin >> i;
  }
  sort(begin(v), end(v));
  while(q--){
    int a, b;
    cin >> a >> b;
    if(a > b) swap(a, b);
    auto u = lower_bound(begin(v), end(v), a + b);
    auto l = lower_bound(begin(v), end(v), b - a + 1);
    cout << u - l << endl;
  }
  return 0;
}