#include<cstdio>
#include<algorithm>
#include<string>
#include<queue>
#include<stack>
#include<vector>
#include<cstring>
#include<iostream>
#include<cmath>
#include<cstdlib>
#include<set>
#include<sstream>
#include<map>
using namespace std;
int va[100010];
int main()
{
    int ca;
    scanf("%d",&ca);
    while(ca--){
        int n,m;
        bool flag=false;
        map<int,int> cnt;
        scanf("%d%d",&n,&m);
        for(int i=1;i<=n;i++){
            scanf("%d",&va[i]);
            va[i]+=va[i-1];
            int t=va[i]%m;
            if(cnt.count(t)||t==0){
                flag=true;
            }
            cnt[t]++;
        }
        if(flag) printf("YES\n");
        else printf("NO\n");
    }
    return 0;
}