import sys

def solve():
    def memo_rec(m):
        if m == 0:
            return True
        if dp[m] is not None:
            return dp[m]

        for i in range(1, k + 1):
            if m - i < 0:
                break
            if not memo_rec(m - i):
                dp[m] = True
                return True

        dp[m] = False
        return False

    P = int(input())

    for game in range(P):
        n, k = map(int, input().split())

        dp = [None] * (n + 1)
        dp[0] = True

        ans = memo_rec(n)

        ans = 'Win' if ans else 'Lose'

        print(ans)

if __name__ == '__main__':
    solve()