#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[nmax][Kmax][Pmax];
int cnt[Pmax];
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 j=1; j<=m; j++){
        int k, p;
        f >> k >> p;
        //cpy[] = restulrile lui a[] la p
        for(int i=1; i<=n; i++) cpy[i] = a[i] % p;
        for(int i=1; i<=n; i++){
            for(int j=0; j<Kmax; j++)
                for(int rest=0; rest<Pmax; rest++) dp[i][j][rest] = 0;
        }
        int ok = 0;
        dp[1][1][cpy[1]] = a[1];
        for(int i=2; i<=n; i++){
            for(int j=i-1; j>=1; j--){
                for(int w=0; w<=k; w++){
                    for(int rest=0; rest<p; rest++){
                        if (dp[j][w][rest] ==0) continue;
                        dp[i][w+1][(rest+cpy[i])%p] = max(dp[i][w+1][(rest+cpy[i])%p], dp[j][w][rest] + a[i]);
                    }
                }
            }
            if (dp[i][k][0] != 0){ g << dp[i][k][0] << "\n"; ok = 1 ;break;}
        }
        if (ok == 0) g << "-1" << "\n";
    }


}

int main(){

    citeste();
    rezolva();

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

    return 0;

}