#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define Int long long

int getgrundy(int x, vector<int> & grundy, int N, int K){
  if(grundy[x] != -1) return grundy[x];
  set<int> Set;
  for(int i=x+1; i <= min(x+K, N-1); i++){
    Set.insert(getgrundy(i, grundy, N, K));
  }
  int subgame = 0;
  while(Set.count(subgame)) subgame++;
  return grundy[x] = subgame;
}

void solve(){
  int N, K;
  cin >> N >> K;
  vector<int> grundy(N, -1);
  grundy[N-1] = 0;
  int gameval = getgrundy(0, grundy, N, K);
  if(gameval){
    cout << "Win" << endl;
  }else{
    cout << "Lose" << endl;
  }
}

int main() {
  int P;
  cin >> P;
  rep(i, P){
    solve();
  }
  return 0;
}