#include <iostream>
#include <cstdio>
#include <vector>
#include <algorithm>
#include <utility>

using namespace std;

void solve(int n, int k) {
	int winpoint = (n - 1) % (k + 1);
	if (1 <= winpoint && winpoint <= k) {
		cout << "Win" << endl;
	} else {
		cout << "Lose"<< endl;
	}
}

int main() {
	int p, n, k;
	cin >> p;

	for (int i = 0; i < p; i++) {
		cin >> n >> k;
		solve(n, k);
	}

	return 0;
}