#include <bits/stdc++.h>
#define pii pair<int,int>
#define pb push_back
#define yes "YES"
#define no "NO"
#define ll long long
#define MOD 1000000007
#define all(x) x.begin(),x.end()
#define MOD2 998244353
using namespace std;
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
template <typename T> 
using ordered_set = tree<T, null_type, less<T>, rb_tree_tag,tree_order_statistics_node_update>;
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
void solve(int cas){
    int n,m;
    cin>>n>>m;
    vector<ll> cm(n+1);
    for (int i = 1; i <= n; i++) cin>>cm[i];
    vector<bool> o(61);
    for (int i = 0; i<=n; i++) o[cm[i]] = true;
    vector<vector<ll>> dp (61, vector<ll> (61,-1));
    int d = -1, c = -1;
    auto dfs = [&] (auto&& self, int camp, int days) -> ll{
        if (days >= d || camp > c) return 0;
        if (camp==c) return 1;
        if (dp[camp][days]!=-1) return dp[camp][days];
        ll res = self(self, camp + 1, days + 1);
        if (o[camp]){
            res+=self(self, camp, days + 1);
        }
        return dp[camp][days]=res;
    };
    while (m--){
        for (int i = 0; i <= 60; i++){
            for (int j = 0; j<=60; j++){
                dp[i][j] = -1;
            }
        }
        cin>>c>>d;
        c = cm[c];
        cout<<dfs(dfs,0,0) + dfs(dfs,1,0)<<endl;
    }
}
int main(){
    int t=1;
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cout.tie(NULL);
    //cin>>t;
    for (int i = 1; i<=t; i++){
        solve(i);
    }
    return 0;
}