#include <iostream>
#include <algorithm>
#include <vector>
#include <iomanip>
#include <map>
#include <queue>

static const int MOD = 1000000007;
using ll = long long;
using u32 = unsigned;
using namespace std;

template<class T>
constexpr T INF = ::numeric_limits<T>::max() / 32 * 15 + 208;

int main() {
    int p;
    cin >> p;
    for (int i = 0; i < p; ++i) {
        int n, k;
        cin >> n >> k;
        puts((n-1)%(k+1) == 0 ? "Lose" : "Win");
    }
    return 0;
}