#include <iostream>
#include <algorithm>
#include <cstdio>
typedef long long ll;
using namespace std;
int as[1<<20];
typedef pair<ll, int> P;
P ps[1<<20];
P ps2[1<<20];
int main() {
    int t;
    scanf("%d",&t);
    for(int a=1; a<=t; ++a) {
        int n;
        ll k;
        int kk;
        scanf("%d %d",&n,&kk);
        k=kk;
        for(int i=0; i<n; ++i) scanf("%d",&as[i]);

        bool res=0;
        for(int st=0; st<=1; ++st) {
            ll sum=0;
            int pp=0;
            for(int i=st; i<n; ++i) {
                int sign = (i-st)&1 ? -1 : 1;
                if (sign==1) {
                    ps[pp++] = P(sum,i);
                }
                sum += as[i] * sign;
                ps2[i] = P(sum,i);
//                cout<<"sum "<<i<<" = "<<sum<<'\n';
            }
            sort(ps,ps+pp);
            ps[pp] = P(0,1e9);
            sort(ps2+st,ps2+n);

            for(int i=st, end=0; i<n; ++i) {
                P q = ps2[i];
                ll req = q.first - k;
                while(end<pp && ps[end].first < req) ++end;
//                cout<<"asd "<<q.second<<' '<<q.first<<' '<<req<<' '<<ps[end].first<<'\n';
                if (ps[end].first == req && ps[end].second <= q.second) {
                    res=true;
                    goto end;
                }
            }
        }
end:

        cout<<"Case #"<<a<<": "<<(res?"Yes":"No")<<".\n";
    }
}