#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cstring>
#include <cmath>
#include <cstdlib>
#include <cctype>
#include <queue>
#include <stack>
#include <map>
#include <vector>
#include <set>
#include <utility>
#define ll long long
const int inf=0x3f3f3f3f;
using namespace std;

int n,m,a[100010];
int sum[100010];
int main()
{
    //freopen("input.txt","r",stdin);
    //freopen("output.txt","w",stdout);
    int t;
    scanf("%d",&t);
    while(t--)
    {
        scanf("%d%d",&n,&m);
        for(int i=0;i<n;i++)
            scanf("%d",&a[i]);
        //sort(a,a+n);
        sum[0]=a[0];
        for(int i=1;i<n;i++)
            sum[i]=sum[i-1]+a[i];
        int goal=0;
        bool flag=false;
        //
        while(true)
        {
            goal+=m;
            if(goal>sum[n-1]) break;
            int i=0,j=lower_bound(sum,sum+n,goal)-sum;
            int temp=sum[j];
            while(i<=j)
            {
                if(temp>goal)
                {
                    temp-=a[i];
                    i++;
                }
                else if(temp<goal)
                {
                    if(j==n-1) break;
                    j++;
                    temp+=a[j];
                }
                else
                {
                    flag=true;
                    break;
                }
            }
            if(flag) break;
        }
        //
        if(flag) printf("YES\n");
        else printf("NO\n");
    }
    return 0;
}