#include using namespace std; #define repu(i, a, b) for (int i = (a); i < (b); ++i) #define repd(i, a, b) for (int i = (a); i > (b); --i) #define mem(a, x) memset(a, x, sizeof(a)) #define all(a) a.begin(), a.end() #define uni(a) a.erase(unique(all(a)), a.end()) typedef long long ll; const int MOD = 1000000007; template inline T tmin(T a, U b) {return (a < b) ? a : b;} template inline T tmax(T a, U b) {return (a > b) ? a : b;} template inline void amax(T &a, U b) {if (b > a) a = b;} template inline void amin(T &a, U b) {if (b < a) a = b;} template inline T tabs(T a) {return (a > 0) ? a : -a;} template T gcd(T a, T b) {while (b != 0) {T c = a; a = b; b = c % b;} return a;} const int N = 120005; int s[N]; int main(int argc, char *argv[]) { ios_base::sync_with_stdio(false); int ntest, n, k; cin >> ntest; for (; ntest; --ntest) { cin >> n >> k; s[0] = s[1] = 0; repu(i, 2, n + 1) { int x = s[i - 1], cnt = i - 1; if (i - k - 1 >= 0) x -= s[i - k - 1], cnt = k; s[i] = s[i - 1]; if (x < cnt) s[i]++; } printf("%s\n", s[n] - s[n - 1] == 1 ? "Win" : "Lose"); } return 0; }