import sys, math
sys.setrecursionlimit(1000000)
INF = 1 << 100
#mod = 1000000007
mod = 998244353
input = lambda: sys.stdin.readline().rstrip()
li = lambda: list(map(int, input().split()))

class RMQ:
    def __init__(self, N):
        self.size = N
        self.inf = 2**31-1
        self.tree = [self.inf] * (2*N+1)

    def query(self, l, r):
        # return minimum element in range [l, r) 
        L = l + self.size
        R = r + self.size
        ans = self.inf
        while L < R:
            if R % 2:
                R -= 1
                ans = min(ans, self.tree[R])
            if L % 2:
                ans = min(ans, self.tree[L])
                L += 1
            L //= 2; R //= 2
        return ans
    
    def update(self, i, v):
        # change A[i] to v
        idx = i + self.size
        self.tree[idx] = v
        while 1:
            idx //= 2
            if idx == 0:
                break
            a, b = self.tree[idx*2+1], self.tree[idx*2]
            self.tree[idx] = min(a, b)


def f(n, k):
    tree = RMQ(n+5)
    tree.update(n-1, 0)
    for i in range(n-1)[::-1]:
        j = min(i+k+1, n+2)
        x = tree.query(i+1, j)
        tree.update(i, x ^ 1)
        #print(i, x^1)
    if tree.query(0, 1) == 0:
        return 'Lose'
    return 'Win'

P = int(input())
for _ in range(P):
    n, k = li()
    print(f(n, k))