#include <bits/stdc++.h>

using namespace std;

ifstream fin("tricouri.in");
ofstream fout("tricouri.out");

const int nmax = 300005;
int n, m, v[nmax], fr[25], k, p, dp[105][6][21];
vector <int> a[25];

int solve(int i, int j, int s, int mod){
    if (dp[i][j][s] > 0){
        return dp[i][j][s];
    }
    if (j == 0){
        if (s == 0){
            return 0;
        }
        return -(1 << 30);
    }
    if (i == a[mod].size()){
        return -(1 << 30);
    }
    return dp[i][j][s] = max(a[mod][i] + solve(i + 1, j - 1, (s + a[mod][i]) % mod, mod), solve(i + 1, j, s, mod));
}

int main(){
    fin >> n >> m;
    for (int i = 1; i <= n; ++i){
        fin >> v[i];
    }
    sort(v + 1, v + n + 1);
    for (int i = 2; i <= 20; ++i){
        for (int j = 0; j < i; ++j){
            fr[j] = 5;
        }
        for (int j = n; j >= 1; --j){
            if (fr[v[j] % i] > 0){
                a[i].push_back(v[j]);
                fr[v[j] % i]--;
            }
        }
    }
    while (m--){
        fin >> k >> p;
        for (int i = 0; i <= a[p].size(); ++i){
            for (int j = 0; j <= k; ++j){
                for (int t = 0; t < p; ++t){
                    dp[i][j][t] = 0;
                }
            }
        }
        int ans = solve(0, k, 0, p);
        if (ans < 0){
            ans = -1;
        }
        fout << ans << "\n";

    }
    fin.close();
    fout.close();
    return 0;
}