#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;
}
