#include <bits/stdc++.h>
using namespace std;
#define F first
#define S second
int t , n , k , dp[55][55] , vist[55][55] , vid;
int rec(int l , int r)
{
if (r-l+1 < k)return 0;
if (vist[l][r] == vid)return dp[l][r];
vist[l][r] = vid;
int en = l , st = l;
for (int j = 1 ; j < k ; ++j)
en++;
set<int>se;
while(en <= r)
{
se.insert(rec(l , st-1) ^ rec(en+1 , r));
st++ , en++;
}
int cou = 0;
for (auto x : se)
{
if (x != cou)break;
cou++;
}
return dp[l][r] = cou;
}
int main()
{
ios::sync_with_stdio(0);
cin.tie(0);
cin >> t;
for (int tt = 1 ; tt <= t ; ++tt)
{
cin >> n >> k;
vid++;
if (rec(1 , n))
cout << "Case " << tt << ": " << "Winning" << '\n';
else
cout << "Case " << tt << ": " << "Losing" << '\n';
}
return 0;
}
I2luY2x1ZGUgPGJpdHMvc3RkYysrLmg+CnVzaW5nIG5hbWVzcGFjZSBzdGQ7CiNkZWZpbmUgRiBmaXJzdAojZGVmaW5lIFMgc2Vjb25kCmludCB0ICwgbiAsIGsgLCBkcFs1NV1bNTVdICwgdmlzdFs1NV1bNTVdICwgdmlkOwppbnQgcmVjKGludCBsICwgaW50IHIpCnsKICBpZiAoci1sKzEgPCBrKXJldHVybiAwOwogIGlmICh2aXN0W2xdW3JdID09IHZpZClyZXR1cm4gZHBbbF1bcl07CiAgdmlzdFtsXVtyXSA9IHZpZDsKICBpbnQgZW4gPSBsICwgc3QgPSBsOwogIGZvciAoaW50IGogPSAxIDsgaiA8IGsgOyArK2opCiAgICBlbisrOwogIHNldDxpbnQ+c2U7CiAgd2hpbGUoZW4gPD0gcikKICB7CiAgICBzZS5pbnNlcnQocmVjKGwgLCBzdC0xKSBeIHJlYyhlbisxICwgcikpOwogICAgc3QrKyAsIGVuKys7CiAgfQogIGludCBjb3UgPSAwOwogIGZvciAoYXV0byB4IDogc2UpCiAgewogICAgaWYgKHggIT0gY291KWJyZWFrOwogICAgY291Kys7CiAgfQogIHJldHVybiBkcFtsXVtyXSA9IGNvdTsKfQppbnQgbWFpbigpCnsKICBpb3M6OnN5bmNfd2l0aF9zdGRpbygwKTsKICBjaW4udGllKDApOwogIGNpbiA+PiB0OwogIGZvciAoaW50IHR0ID0gMSA7IHR0IDw9IHQgOyArK3R0KQogIHsKICAgIGNpbiA+PiBuID4+IGs7CiAgICB2aWQrKzsKICAgIGlmIChyZWMoMSAsIG4pKQogICAgICBjb3V0IDw8ICJDYXNlICIgPDwgdHQgPDwgIjogIiA8PCAiV2lubmluZyIgPDwgJ1xuJzsKICAgIGVsc2UKICAgICAgY291dCA8PCAiQ2FzZSAiIDw8IHR0IDw8ICI6ICIgPDwgIkxvc2luZyIgPDwgJ1xuJzsKICB9CgoKICByZXR1cm4gMDsKfQo=