#include <iostream>
#include <fstream>
#include <algorithm>

using namespace std;

ifstream f("tricouri.in");
ofstream g("tricouri.out");

#define nmax 300005
#define Kmax 6
#define Pmax 21

int n, m, a[nmax], cpy[nmax], dp[Pmax][Kmax];
int aux[nmax];

void citeste(){

	f >> n >> m;
	for(int i=1; i<=n; i++) f >> a[i];
	sort(a+1, a+n+1);

	for(int i=1; i<=n; i++) aux[i] = a[i];
	for(int i=1, j=n; i<=n; j--,i++) a[i] = aux[j];//fac un reverse

}

void rezolva(){

    //am m query de forma k,p sortez elementele descesctor si acum caut primul subsir care are k elemente si restul 0 la p(fiind sortate o sa imi dea suma maxima)

    //dp[rest][k] suma elementelor avand restul rest si fiind k elemente

    for(int i=1; i<=m; i++){
        int k, p;
        f >> k >> p;
        //cpy[] = restulrile lui a[] la p
        for(int i=1; i<=n; i++) cpy[i] = a[i] % p;
        //cout << "\n";
        for(int i=0; i<Pmax; i++){
            for(int j=0; j<Kmax; j++) dp[i][j] = 0;
        }

        dp[ cpy[1]] [1] = a[1];
        int ok = 0;
        for(int i=2; i<=n; i++){
            //if (dp[ cpy[i] ][1] == 0) dp[ cpy[i] ][1] = a[i];
            for(int rest=0; rest<p; rest++){
                for(int w=0; w<=k; w++){
                    if (dp[rest][w] == 0) continue;
                    if (dp[(rest+cpy[i]) %p ][w+1] == 0){
                        dp[(rest+cpy[i]) %p ][w+1] = dp[rest][w] + a[i];
                    }
                }
            }
            if (dp[0][k] != 0){
                g << dp[0][k] << "\n";
                ok = 1;
                break;
            }
        }
        if (ok == 0) g << -1 << "\n";
    }


}

int main(){

    citeste();
    rezolva();

    f.close();
    g.close();

    return 0;

}