def boutori(N, K):
    while N > (1 + K):
        N -= (1 + K)
    if N == 1:
        return 'Lose'
    elif 1 < N <= (1 + K):
        return 'Win'

if __name__ == '__main__':
    P = int(input())
    N = [0 for n in range(P)]
    K = [0 for k in range(P)]
    for i in range(P):
        N[i], K[i] = map(int, input().split())
    for j in range(P):
        print(boutori(N[j], K[j]))