#include <bits/stdc++.h>
// #include <ext/pb_ds/assoc_container.hpp> 
// #include <ext/pb_ds/tree_policy.hpp>
 
using namespace std;
// using namespace __gnu_pbds;
typedef long long ll;
typedef long double ld;
 
typedef pair<ll, ll> pl;
typedef pair<ld,ld> pd;
typedef vector<ll> vl;
// typedef tree<ll, null_type, less<ll>, rb_tree_tag, tree_order_statistics_node_update> ordered_set;
 
 
#define G(x) ll x; cin >> x;
#define F(i, l, r) for (ll i = l; i < (r); ++i)
#define all(a) begin(a), end(a)
#define K first
#define V second
#define OK(i,j) i >= 0 && i < n && j >= 0 && j < m
 
#define NN 2505
#define MM 5005
#define MOD 1000007

ll dp[65][65];
bool oasis[65];

void solve() {

    ll N, M;
    cin >> N >> M;
    ll oasis_camps[N];
    oasis[0] = 1;
    for(ll i=0;i<N;i++) {
        cin >> oasis_camps[i];
        oasis[oasis_camps[i]] = 1;
    }

    dp[0][0] = 1;
    for(ll j=1;j<65;j++) {
        for(ll i=0;i<65;i++) {
            if(oasis[i]) dp[i][j] += dp[i][j-1];
            if(i > 0) dp[i][j] += dp[i-1][j-1];
        }
    }

    ll d, t;
    for(ll i=0;i<M;i++) {
        cin >> d >> t;
        cout << dp[oasis_camps[d-1]][t] << '\n';
    }


}

int main() {
    cin.tie(0)->sync_with_stdio(0);
    cout << fixed << setprecision(10);

    solve();

    return 0;

}