#include <stack>
#include <cstdio>
#include <list>
#include <cassert>
#include <set>
#include <iostream>
#include <string>
#include <vector>
#include <queue>
#include <functional>
#include <cstring>
#include <algorithm>
#include <cctype>
#include <string>
#include <map>
#include <cmath>
using namespace std;
#define LL long long
#define ULL unsigned long long
#define SZ(x) (int)x.size()
#define Lowbit(x) ((x) & (-x))
#define MP(a, b) make_pair(a, b)
#define MS(arr, num) memset(arr, num, sizeof(arr))
#define PB push_back
#define X first
#define Y second
#define ROP freopen("input.txt", "r", stdin);
#define MID(a, b) (a + ((b - a) >> 1))
#define LC rt << 1, l, mid
#define RC rt << 1|1, mid + 1, r
#define LRT rt << 1
#define RRT rt << 1|1
const double PI = acos(-1.0);
const int INF = 0x3f3f3f3f;
const double eps = 1e-8;
const int MAXN = 1e6 + 10;
const int MOD = 9901;
const int dir[][2] = { {-1, 0}, {0, -1}, { 1, 0 }, { 0, 1 } };
int cases = 0;
typedef pair<int, int> pii;
 
vector<LL> mp;
LL sum[MAXN];
int n, k;
 
bool Solve()
{
    for (int i = 0; i < n; i++)
    {
        if (!(i & 1))
        {
            if (binary_search(mp.begin(), mp.end(), sum[i]+k)) return true;
        }
        else if (binary_search(mp.begin(), mp.end(), sum[i]-k)) return true;
    }
    return false;
}
 
int main()
{
    //ROP;
    int T;
    scanf("%d", &T);
    while (T--)
    {
        mp.clear();
        scanf("%d%d", &n, &k);
        for (int i = 1, t = 1; i <= n; i++, t = -t)
        {
            scanf("%I64d", ∑[i]);
            sum[i] = sum[i-1] + t*sum[i];
            mp.PB(sum[i]);
        }
        mp.PB(0);
        sort(mp.begin(), mp.end());
        printf("Case #%d: %s.\n", ++cases, Solve() ? "Yes" : "No");
    }
    return 0;
}