#include<iostream>
#include<vector>
#include<algorithm>
using namespace std;
using ll = long long;

int main(void){
  int p; cin >> p;
  while(p--){
    int n, k; cin >> n >> k;
    vector<int> dp(n+1, -1);
    auto dfs=[&](auto dfs, int now){
      if(dp[now]!=-1) return dp[now];
      if(now>=n-1) return dp[now]=0;
      if(now>=n-k-1) return dp[now]=1;
      for(int i=min(n, now+k); i>=now+1; i--){
        if(dfs(dfs, i)==0) return dp[now]=1;
      }
      return dp[now]=0;
    };

    cout << (dfs(dfs, 0)?"Win\n":"Lose\n");
  }
  return 0;
}