#include <iostream>
#include <sstream>
#include <string>
#include <vector>
#include <list>
#include <stack>
#include <queue>
#include <deque>
#include <set>
#include <map>
#include <algorithm>
#include <functional>
#include <limits>
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <climits>
#include <complex>

using namespace std;

#define INF (INT_MAX/3)
#define PI (2*acos(0.0))
#define EPS (1e-8)

typedef long long ll;
typedef unsigned long long ull;

int P, N, K, memo[120001];

bool isWinning(int n){
  if(memo[n] >= 0) return (bool)memo[n];

  for(int i = 1; i <= K; i++){
    if(n + i >= N) continue;
    if(!isWinning(n + i)) return memo[n] = true;
  }

  return memo[n] = false;
}

void init(){
  for(int i = 0; i <= 120000; i++) memo[i] = -1;
}

int main(){
  ios_base::sync_with_stdio(0);
  cin >> P;
  while(P--){
    cin >> N >> K;
    init();
    if(isWinning(0)) cout << "Win" << endl;
    else cout << "Lose" << endl;
  }
  return 0;
}