#include #include #include #define maxn 100005 using namespace std; int T,n,m,a[maxn],sum[maxn]; bool vis[5005]; int main() { scanf("%d",&T); while (T--) { memset(vis,0,sizeof(vis)); memset(a,0,sizeof(a)); memset(sum,0,sizeof(sum)); scanf("%d%d",&n,&m); bool f=0; for (int i=1;i<=n;i++) scanf("%d",&a[i]); for (int i=1;i<=n;i++) { sum[i]=a[i]+sum[i-1]; sum[i]%=m; if (sum[i]==0) { f=1; break; } } if (f) { printf("YES\n"); continue ; } for (int i=1;i<=n;i++) if (!vis[sum[i]]) vis[sum[i]]=1; else { f=1; break; } if (f) printf("YES\n"); else printf("NO\n"); } return 0; }