#include <bits/stdc++.h>

using namespace std;
typedef long long int ll;
typedef pair<int, int> P;
typedef pair<ll, ll> Pll;
typedef vector<int> Vi;
typedef tuple<int, int, int> T;
#define FOR(i,s,x) for(int i=s;i<(int)(x);i++)
#define REP(i,x) FOR(i,0,x)
#define ALL(c) c.begin(), c.end()
#define DUMP( x ) cerr << #x << " = " << ( x ) << endl

int dp[120010];
int N, K;

int dpdp(int n) {
  if (n >= N) return 1;
  if (dp[n] != -1) return dp[n];

  int ret = 0;
  for (int i = K; i >= 1; i--) {
    if (!dpdp(n+i)) ret = 1;
  }
  return dp[n] = ret;
}

int main() {
  // use scanf in CodeForces!
  cin.tie(0);
  ios_base::sync_with_stdio(false);

  int P;
  cin >> P;
  REP(i, P) {
    cin >> N >> K;
    memset(dp, -1, sizeof(dp));
    cout << (dpdp(0) ? "Win" : "Lose") << endl;
  }  
  return 0;
}