# coding: utf-8
import array, bisect, collections, heapq, itertools, math, random, re, string, sys, time

sys.setrecursionlimit(10 ** 7)
INF = 10 ** 20
MOD = 10 ** 9 + 7


def II(): return int(input())
def ILI(): return list(map(int, input().split()))
def IAI(LINE): return [ILI() for __ in range(LINE)]
def IDI(): return {key: value for key, value in ILI()}


def solve(P, N, K):
    ans = []
    for n, k in zip(N, K):
        if (n % (k + 1)) == 1:
            ans.append("Lose")
        else:
            ans.append("Win")
    return ans


def main():
    P = II()
    N = []
    K = []
    for __ in range(P):
        n, k = ILI()
        N.append(n)
        K.append(k)
    ans = solve(P, N, K)
    for i in ans:
        print(i)


if __name__ == "__main__":
    main()