#include <iostream>
#include <cstdio>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <algorithm>
#include <cmath>
#include <cstring>
using namespace std;
const int MAXN = 100010;
int a[MAXN];
int b[MAXN];
bool c[MAXN];
int main()
{
    int t;
    cin >> t;
    while(t--)
    {
        int n, m;
        cin >> n >> m;
        bool flag = false;
        memset(c, 0, sizeof(c));
        b[0] = 0;
        for(int i = 1; i <= n; i++)
        {
            scanf("%d", a + i), b[i] = b[i - 1] + a[i];
            int temp = b[i] % m;
            if(c[temp])
                flag = true;
            c[temp] = true;
        }
        if(flag)
            puts("YES");
        else
            puts("NO");
    }
}