1 //#pragma comment(linker, "/STACK:102400000, 102400000")
 2 #include <algorithm>
 3 #include <iostream>
 4 #include <cstdlib>
 5 #include <cstring>
 6 #include <cstdio>
 7 #include <vector>
 8 #include <cmath>
 9 #include <ctime>
10 #include <list>
11 #include <set>
12 #include <map>
13 using namespace std;
14 typedef long long LL;
15 typedef pair <int, int> P;
16 const int N = 1e5 + 5;
17 int a[N], cnt[N];
18 
19 int main()
20 {
21     int t, n, k;
22     scanf("%d", &t);
23     while(t--) {
24         scanf("%d %d", &n, &k);
25         memset(cnt, 0, sizeof(cnt));
26         bool ok = false;
27         for(int i = 1 ; i <= n ; ++i) {
28             scanf("%d", a + i);
29             a[i] = (a[i] + a[i - 1]) % k;
30             cnt[a[i]]++;
31             if(cnt[a[i]] > 1 || !a[i])
32                 ok = true;
33         }
34         if(ok)
35             printf("YES\n");
36         else
37             printf("NO\n");
38     }
39     return 0;
40 }