#include <bits/stdc++.h>
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n)  for(int i=0;i<(n);i++)
#define FORq(i, m, n) for(int i = (m);i <= (n);++i)
#define SCD(n) scanf("%d",&n)
#define SCD2(m,n) scanf("%d%d",&m,&n)
#define SCD3(m,n,k) scanf("%d%d%d",&m,&n,&k)
#define PB push_back
#define MP make_pair
#define ARSCD(A,N) REP(i,N){SCD(A[i]);}
#define ARSCD1(A,N) FORq(i,1,N){SCD(A[i]);}
#define PRINTD(n) printf("%d\n",n)
#define PRINTLLD(n) printf("%lld\n",n)
#define DEBUG printf("%s\n","debug")
#define fst first
#define snd second
using namespace std;
typedef pair<int,int> PII;
typedef vector<int> VI;
typedef long long ll;
//////////////////////////////////////////////////////
int main(){
	int P; SCD(P);
	int N[P];
	int K[P];
	
	REP(i,P){
		int n,k; SCD2(n,k);
		N[i] = n; K[i] = k;
	}

	REP(i,P){
		static bool dp[120002];
		dp[2] = true;
			FORq(j,3,N[i]){
				bool nwin = false;
				FORq(k,1,K[i]){
					if (j-k < 0) break;
					
					if (!dp[j-k]){
						nwin = true;
						break;
					}
				}
				dp[j] = nwin;
			}
		
		if (dp[N[i]]) printf("Win\n");
		else printf("Lose\n");
	}
	
	
	return 0;
}