tjut 5776

//#pragma comment(linker, "/STACK:102400000, 102400000")
#include <algorithm>
#include <iostream>
#include <cstdlib>
#include <cstring>
#include <cstdio>
#include <vector>
#include <cmath>
#include <ctime>
#include <list>
#include <set>
#include <map>
using namespace std;
typedef long long LL;
typedef pair <int, int> P;
const int N = 1e5 + 5;
int a[N], cnt[N];

int main()
{
    int t, n, k;
    scanf("%d", &t);
    while(t--) {
        scanf("%d %d", &n, &k);
        memset(cnt, 0, sizeof(cnt));
        bool ok = false;
        for(int i = 1 ; i <= n ; ++i) {
            scanf("%d", a + i);
            a[i] = (a[i] + a[i - 1]) % k;
            cnt[a[i]]++;
            if(cnt[a[i]] > 1 || !a[i])
                ok = true;
        }
        if(ok)
            printf("YES\n");
        else
            printf("NO\n");
    }
    return 0;
}