// Haromszogek.cpp : This file contains the 'main' function. Program execution begins and ends there.
//

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

std::vector<int> v;

int keres(int elso, int utolso, int mit, int plusz)
{
    if (elso == utolso) {
        return elso;
    }
    else
    if (elso == utolso - 1) {
        if (v[elso] == mit) return elso;
        else if (v[utolso] == mit)return utolso;
        else if (plusz) return utolso;
        else return elso;
    }
    else {
        int k = (elso + utolso) / 2;
        if (v[k] == mit) return k;
        else if (mit < v[k]) return keres(elso, k - 1, mit,plusz);
        else return keres(k + 1, utolso, mit, plusz);
    }
}
int main()
{
    int N;
    int Q;
    std::cin >> N >> Q;
    for (int i = 1; i <= N; i++) {
        int a;
        std::cin >> a;
        v.push_back(a);
    }
    sort(v.begin(), v.end());
     for (int i = 1; i <= Q; i++) {
        int a, b; 
        std::cin >> a >> b;
        if (a > b) std::swap(a, b);
        int k = keres(0, v.size(), a + b,1);
        int p = keres(0, v.size(), b - a,0);
        if (k >= v.size()) k--;
        else {
            if (v[k] >= a + b) k--;
        }
        if (p < 0) p++;
        else { if (v[p] <= b - a) p++; }
        //std::cout << k << " " << p << std::endl;
        std::cout << k - p + 1 << std::endl;
    }


}