#include <iostream>
#include <vector>
#include <array>
#include <algorithm>
#include <string>
#include <map>
#include <queue>
#include <iomanip>
#include <numeric>
#include <memory>
#include <limits.h>
#include <set>
#include <cassert>
#include <cmath>
#include <bitset>
using namespace std;

typedef long long ll;

#define REP(i,n) for(ll i=0; i<(n); ++i)
#define TEN(x) ((ll)1e##x)
#define ALL(v) (v).begin(), (v).end()

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

		vector<bool> win(n + 1);
		win[n] = true;
		win[n - 1] = false;
		ll count_false = 1;
		for (ll j = n - 2; j >= 0; --j) {
			win[j] = count_false != 0;
			if (!win[j]) count_false++;
			if (j + k <= n && !win[j + k]) count_false--;
		}

		cout << (win[0] ? "Win" : "Lose") << endl;
	}
	return 0;
}