#include <iostream>
#include <vector>
#include <cstdio>
#include <sstream>
#include <map>
#include <string>
#include <algorithm>
#include <queue>
#include <set>
#include <cmath>

using namespace std;

int grundy(vector<int> &memo, int x, const int &N, const int &K){
	if(memo[x] >= 0) return memo[x];

	set<int> s;
	for(int i=1; i<=K; i++){
		if(x+i >= N) break;
		s.insert( grundy(memo, x+i, N, K) );
	}
	int ret = 0;
	while( s.count(ret) != 0 ) ret++;
	memo[x] = ret;
	return ret;
}

void solve(){
	int N,K;
	cin >> N >> K;
	vector<int> memo(N+1, -1);
	cout << (grundy(memo,0,N,K) != 0? "Win":"Lose") << endl;
}

int main(){
	int N;
	cin >> N;
	for(int i=0; i<N; i++){
		solve();
	}
	return 0;
}