#include <iostream>
#include <cstring>
using namespace std;

const int kMAX_N = 120010;

int memo[kMAX_N];

int N, K, P;

int win(int number) {
    if (memo[number] >= 0) return memo[number];
    if (number >= N) return memo[number] = 1;
    int result = 0;
    for (int i = 1; i <= K; i++) {
        if (!win(number + i)) {
            result = 1;
            break;
        }
    }
    return memo[number] = result;
}

void Solve() {
    memset(memo, -1, sizeof(memo));

    if (win(0)) cout << "Win" << endl;
    else cout << "Lose" << endl;
}

int main() {
    cin >> P;

    for (int i = 0; i < P; i++) {
        cin >> N >> K;

        Solve();
    }
    return 0;
}