LOJ - 1125 - Divisible Group Sums

//Make CSP great again
#include <bits/stdc++.h>
#define TASK "TESTCODE"
using namespace std;
long long dp[201][12][20], a[201];
int n, m, d, q;
void read()
{
   cin >> n >> q;
   for (int i = 1; i <= n; ++ i)
   {
       cin >> a[i];
   }
}
void solve()
{
   while (q--)
   {
       cin >> d >> m;
       memset(dp, 0, sizeof(dp));
       dp[0][0][0] = 1;
       for (int i = 1; i <= n; ++ i)
       {
           dp[i][0][0] = 1;
           for (int j = 1; j <= m; ++ j)
           {
               for (int k = 0; k < d; ++ k)
               {
                   dp[i][j][k] += dp[i-1][j][k];
                   dp[i][j][k] += dp[i-1][j-1][(k - (a[i] % d) + d) % d];
               }
           }
       }
       cout << dp[n][m][0] << '\n';
   }
}
int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    //freopen(TASK".INP", "r", stdin);
    //freopen(TASK".OUT", "w", stdout);
    int t = 1;
    bool typetest = true;
    if (typetest)
    {
        cin >> t;
    }
    for (int __ = 1; __ <= t; ++ __)
    {
        cout << "Case " << __ << ": " << '\n';
        read();
        solve();
    }
}