#include <bits/stdc++.h>
using namespace std;
typedef long long ll;

vector<int> getprimes(int n) {
    bool isprime[n+1];
    fill(isprime, isprime+n+1, true);
    vector<int> primes;
    for (int i = 2; i <= n; i++) {
        if (!isprime[i]) continue;
        primes.push_back(i);
        for (int j = i+i; j <= n; j += i)
            isprime[j] = false;
    }
    return primes;
}

int main() {
    int p;
    while (p--) {
        int n, k;
        cin>>n>>k;
        if ((n-1)%(k+1)==0) puts("Lose");
        else puts("Win");
    }
    return 0;
}