#include <bits/stdc++.h>
using namespace std;
#define LL long long
#pragma comment(linker, "/STACK:102400000,102400000")
const int MAXN = 205;
 
LL dp[MAXN][15][21];
 
int num[MAXN], N, Q, M, D;
 
void Solve()
{
    dp[0][0][0] = 1;
    for (int i = 1; i <= N; i++)
        for (int j = 0; j <= M; j++)
            for (int k = 0; k < D; k++)
            {
                dp[i][j][k] = dp[i - 1][j][k];
                if (j)
                {
                    int temp = (D + k - num[i] % D) % D;
                    dp[i][j][k] += dp[i - 1][j - 1][temp];
                }
            }
}
 
int main()
{
    //freopen("input.txt", "r", stdin);
    int i, j, bCases = 0;
    while (scanf("%d%d", &N, &Q), N + Q)
    {
        printf("SET %d:\n", ++bCases);
        int cases = 0;
        for (i = 1; i <= N; i++)
            scanf("%d", #[i]);
        for (i = 0; i < Q; i++)
        {
            printf("QUERY %d: ", ++cases);
            memset(dp, 0, sizeof dp);
            scanf("%d%d", &D, &M);
            Solve();
            printf("%lld\n", dp[N][M][0]);
        }
    }
    return 0;
}