#include <cstdio>

#include <cmath>

#include <cstring>

#include <iostream>

#include <algorithm>

#include <queue>

#include <vector>

#include <map>



using namespace std;



typedef long long LL;


int T,n,m,a[100005],s[100005];
bool flag;

int main()

{
    scanf("%d",&T);
    while (T--)
    {
        scanf("%d%d",&n,&m);
        for (int i=1;i<=n;++i) scanf("%d",&a[i]);
        s[0]=0;
        for (int i=1;i<=n;++i) s[i]=(s[i-1]+a[i])%m;
        flag=false;
        if (n+1>m)
        {
            printf("YES\n");
            continue;
        }
        for (int i=0;i<n;++i)
            for (int j=i+1;j<=n;++j)
                if (s[i]==s[j])
                {
                    flag=true;
                    break;
                }
        if (flag) printf("YES\n");
        else printf("NO\n");
    }

    return 0;

}