#pragma comment(linker, "/STACK:102400000,102400000")
#include <vector>
#include <list>
#include <map>
#include <set>
#include <queue>
#include <deque>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <sstream>
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <ctime>
#include <cstring>
#define LL long long
using namespace std;
const int M=1e5+5,INF=0xc0c0c0c0;
int A[M];
bool mark[5005];
int main() {
    int T;
    scanf("%d",&T);
    while(T--){
        memset(mark,0,sizeof(mark));
        int n,m;
        scanf("%d%d",&n,&m);
        int sum=0;
        for(int j=1;j<=n;j++){
            int a;
            scanf("%d",&A[j]);
        }
        int ok=0;
        mark[0]=1;
        for(int j=1;j<=n;j++){
            sum=(sum+A[j])%m;
//            printf("sum = %d\n",sum);
            if(mark[((sum-m)%m+m)%m]){
                ok=1;
                break;
            }
            mark[sum]=1;
        }
        printf("%s\n",ok?"YES":"NO");
    }
    return 0;
}