import std.stdio, std.algorithm, std.string, std.string, std.conv, std.array;

int readint() { return readln.chomp.to!int; }
auto readints() { return readln.split.map!(to!int); }

int n, k;

int[100010][2] dp;

int rec(int i, int s) {
    if (dp[!(i&1)][s] != -1) return dp[!(i&1)][s];
    if (s >= n) return dp[!(i&1)][s] = !(i & 1);

    int r = rec(i+1, s+1);
    foreach(t; s+2..s+k+1) if (t < n) {
        int nxt = rec(i+1, t);
        if (i & 1) r &= nxt;
        else r |= nxt;
    }
    return dp[!(i&1)][s] = r;
}


void main() {
    int p = readint();
    foreach(_; 0..p) {
        auto nk = readints();
        n = nk[0], k = nk[1];
        foreach(i; 0..2) dp[i][0..$] = -1;
        writeln(rec(0, 0) ? "Win" : "Lose");
    }

    string _ = readln(); // dbg
}