#include <iostream>

 #include <cstring>

 #include <cstdio>

 using namespace std;

 const int N = 1e5 + ;

 int a[N];

 int sum[N], cnt[N];

 int main()

 {

     int t, n, m;

     scanf("%d", &t);

     for(int ca = ; ca <= t; ++ca) {

         scanf("%d %d", &n, &m);

         memset(cnt, , sizeof(cnt));

         cnt[]++;

         for(int i = ; i <= n; ++i) {

             scanf("%d", a + i);

             sum[i] = (sum[i - ] + a[i]) % m;

             cnt[sum[i]]++;

         }

         long long ans = ;

         for(int i = ; i < m; ++i) {

             ans += (long long)cnt[i] * (cnt[i] - ) / ;

         }

         printf("Case %d: %lld\n", ca, ans);

     }

     return ;

 }