#include<cstdio>
#include<cstring>
#include<iostream>
#include<algorithm>
#include<vector>
#include<queue>
#include<map>
#include<set>
using namespace std;
typedef long long LL;
typedef double db;
typedef pair<int,int>p1;
int a[5005];
int main()
{
    int t,n,m;
    cin>>t;
    while(t--){
        scanf("%d%d",&n,&m);
        memset(a,0,sizeof(a));
        int s=0;
        int f=0;
        for(int i=1;i<=n;i++){
            int p;
            scanf("%d",&p);
            s+=p;
            s%=m;
            if(s==0){
                f=1;
            }
            if(a[s]){
                f=1;
            }
            a[s]=1;
        }
        if(f) printf("YES\n");
        else printf("NO\n");
    }
}