#include<iostream>
#include<vector>
#include<cstdio>
#include<algorithm>
#include<cstring>
#include<string>
#include<queue>
#include<cmath>
#include<set>
using namespace std;
int s[100002];
int hashs[100002];
int main()
{
    int n,m;
    int T;
    scanf("%d",&T);
    while(T--)
    {
        scanf("%d %d",&n,&m);

         int flag=0;

        for(int i=0;i<=100001;i++)
            hashs[i]=s[i]=0;

        for(int i=1;i<=n;i++)
        {
            int ts;
            scanf("%d",&ts);
            s[i]=(s[i-1]+ts)%m;
            if(s[i]==0||hashs[s[i]]==1)
            {
                flag=1;
            }
            hashs[s[i]]=1;
        }

        if(flag==0)
            printf("NO\n");
        else
            printf("YES\n");
    }
    return 0;
}