//editor: Jan Tang
//problem:
#include <iostream>
#include <cstdio>
#include <string>
#include <cstring>
#include <algorithm>
#include <cmath>
#include <map>
#include <stack>
#include <queue>
#include <set>
#include <cstdlib>
using namespace std;
#define set0(a) memset(a,0,sizeof(a));
#define CIN(a,n) for(int i=1;i<=n;i++) cin>>a[i];
typedef long long ll;
typedef unsigned long long ull;
const int Mod = 1e9+7;
const int maxn = 100005;
const int inf = 0x3f3f3f3f;
int m,n,a[maxn],s[maxn];
/*==============================head==========================*/
int main(){
    int t; cin >> t;
    while(t-- >0){
        set0(s);
        scanf("%d%d",&n,&m);
            for(int i = 1; i <= n; i++){
                scanf("%d",&a[i]);
                s[i] = s[i-1] +a[i];
                s[i] %= m;
            }
            sort(s,s+1+n);
            int flag = 0;
            for(int i = 1;i<=n;i++)
                if(s[i-1]==s[i])
                    flag = 1;
            if(flag) puts("YES");
            else puts("NO");
        
    }
    return 0;
}