#include <iostream>
#include <cstdio>
#include <string>
#include <cstring>
#include <cmath>
#include <algorithm>
#include <vector>
#include <queue>
using namespace std;
int a[100005];
int main()
{
    int t;
    int i,j;
    int n,m;
    scanf("%d",&t);
    while(t--)
    {
        scanf("%d%d",&n,&m);
        for(i=0;i<n;++i)
        {
            scanf("%d",&a[i]);
            if(i)
            a[i]+=a[i-1];
        }
        int flag=1;
        for(i=0;i<n;++i)
            for(j=0;j < (i>=100?100:i);++j)
        {
            if((a[i]-a[j])/m>=1&&(a[i]-a[j])%m==0)
            {
                flag=0;
                goto xx;
            }
        }
        xx:if(flag)printf("NO\n");
        else printf("YES\n");

     }

    return 0;
}