#include <bits/stdc++.h>
using namespace std;

int dfs( vector< int > &dp, int n, int k ){
  if( ~dp[ n ] )
    return dp[ n ];
  for( int i = 1; i <= k; ++i )
    if( 0 < n - i )
      if( not dfs( dp, n - i, k ) )
        return dp[ n ] = 1;
  return dp[ n ] = 0;
}

signed main(){
  const string message[] = { "Lose", "Win" };
  int P; cin >> P;
  for( int i = 0; i < P; ++i ){
    int N, K; cin >> N >> K;
    vector< int > dp( N + 1, -1 );
    dp[ 1 ] = 0;
    cout << message[ dfs( dp, N, K ) ] << endl;
  }
  return 0;
}