#include<cstdio>
#include<cstdlib>
#include<iostream>
#include<algorithm>
#include<cstring>
#include<string>
#include<cmath>
#include<queue>
#include<vector>
#include<set>
#include<map>
#include<time.h>
#define maxn 100007
#define gran 1000007
#define modp 1000000007
#define minn 1007
#define eps (1E-6)
#define minf (1E-10)
#define infl ((1LL<<62)-1)
#define infm ((1<<30)-1)
#define lim1 30
#define lim2 300
#define lim3 10000
#define fst first
#define scn second

using namespace std;

typedef long long LL;
typedef unsigned long long ULL;
const double PI=4*atan(1);
const double PI2=PI*2;
int n,m,tot,ans;
LL N;

typedef pair<int,int> PA;
typedef pair<double,double> PAf;
typedef pair<PA,PA> PPA;
typedef pair<LL,PA> TPA;

typedef struct sege
{
    int a,c;
    int nxt;
    friend int operator<(struct sege x, struct sege y)
    {
        return x.a<y.a;
    }
}E,*Ptr;

const int go[4][2]={{-1,0},{0,1},{1,0},{0,-1}};

int q[maxn];
int f[maxn];

int main()
{
    int T=1;
    //srand(time(0));
    scanf("%d",&T);
//    while (scanf("%d",&n)!=EOF)
    for (int cT=1;cT<=T;++cT)
    {
        scanf("%d%d",&n,&m);
        memset(f,0,sizeof(f));
        ans=0;
        for (int i=1;i<=n;++i) {
            scanf("%d",q+i);
            q[i]+=q[i-1];
            ++f[q[i]%m];
            if (f[q[i]%m]>1) ans=1;
        }
        printf("%s\n",ans?"YES":"NO");
    }
    return 0;
}