#include <bits/stdc++.h>

using namespace std;

#define cin_2d(vec, n, m) for(int i = 0; i < n; i++) for(int j = 0; j < m && cin >> vec[i][j]; j++);
#define cout_2d(vec, n, m) for(int i = 0; i < n; i++, cout << "\n") for(int j = 0; j < m && cout << vec[i][j] << " "; j++);
#define fixed(n) fixed << setprecision(n)
#define ceil(n, m) (((n) / (m)) + ((n) % (m) ? 1 : 0))
#define fill(vec, value) memset(vec, value, sizeof(vec));
#define mul_mod(a, b, m) (((a % m) * (b % m)) % m)
#define add_mod(a, b, m) (((a % m) + (b % m)) % m)
#define all(vec) vec.begin(), vec.end()
#define rall(vec) vec.rbegin(), vec.rend()
#define sz(x) int(x.size())
#define debug(x) cout << #x << ": " << (x) << "\n";
#define fi first
#define se second
#define ll long long
#define ull unsigned long long
#define Mod  1'000'000'007
#define OO 2'000'000'000
#define EPS 1e-9
#define PI acos(-1)
template < typename T = int > using Pair = pair < T, T >;
vector < string > RET = {"NO", "YES"};

template < typename T = int > istream& operator >> (istream &in, vector < T > &v) {
    for (auto &x : v) in >> x;
    return in;
}

template < typename T = int > ostream& operator << (ostream &out, const vector < T > &v) {
    for (const T &x : v) out << x << ' ';
    return out;
}

vector < vector < int > > dp;

int get_ans(int x, int y){
    if(x <= 0) return 0;
    int& ret = dp[x][y];
    if(~ret) return ret;
    if(x < y) return 0;
    set < int > st;
    for(int i = 1; i <= x; i++){
        int end = i + y - 1;
        if(end > x) continue;
        st.insert(get_ans(i - 1, y) ^ get_ans(x - end, y));
    }
    ret = 0;
    while(st.count(ret)) ret++;
    return ret;
}

void Solve(){
    int n, k;
    cin >> n >> k;
    dp = vector < vector < int > > (n + 1, vector < int > (k + 1, -1));
    cout << (get_ans(n, k) ? "Winning" : "Losing") << "\n";
}

int main(){
    ios_base::sync_with_stdio(false), cin.tie(nullptr), cout.tie(nullptr);
    int t = 1;
    cin >> t;
    for(int tc = 1; tc <= t; tc++){
        cout << "Case " << tc << ": ";
        Solve();
    }
    return 0;
}