Appy and Chef are participating in a contest. There are $N$ problems in this contest; each problem has a unique problem code between $1$ and $N$ inclusive. Appy and Chef decided to split the problems to solve between them ― Appy should solve the problems whose problem codes are divisible by $A$ but not divisible by $B$, and Chef should solve the problems whose problem codes are divisible by $B$ but not divisible by $A$ (they decided to not solve the problems whose codes are divisible by both $A$ and $B$).
To win, it is necessary to solve at least $K$ problems. You have to tell Appy whether they are going to win or lose.

-----Input-----
- The first line of the input contains a single integer $T$ denoting the number of test cases. The description of $T$ test cases follows.
- The first and only line of each test case contains four space-separated integers $N$, $A$, $B$ and $K$.

-----Output-----
For each test case, print a single line containing the string "Win" if they can solve at least $K$ problems or "Lose" otherwise (without quotes).

-----Constraints-----
- $1 \le T \le 15$
- $1 \le K \le N \le 10^{18}$
- $1 \le A, B \le 10^9$

-----Subtasks-----
Subtask #1 (15 points):
- $1 \le T \le 15$
- $1 \le K \le N \le 10^6$
- $1 \le A, B \le 10^3$
Subtask #2 (85 points): original constraints

-----Example Input-----
1
6 2 3 3

-----Example Output-----
Win

-----Explanation-----
Example case 1: Appy is solving the problems with codes $2$ and $4$, Chef is solving the problem with code $3$. Nobody is solving problem $6$, since $6$ is divisible by both $2$ and $3$. Therefore, they can solve $3$ problems and win.

Difficulty: interview

Starter code:

Solutions:
for t in range(int(input())):
 n, a , b , k = map(int,input().split())
 solvedbychef = 0
 solvedbyappy = 0
 for i in range(n+1):
  if i % a == 0 and i % b == 0 :
   continue
  elif i%a == 0 :
   solvedbyappy+=1
  elif i%b == 0:
   solvedbychef+=1
 totalsolved = solvedbychef + solvedbyappy
 if totalsolved>=k:
  print("Win")
 else :
  print("Lose")

import math
for i in range(int(input())):
 z,a,b,k=list(map(int,input().split())) 
 n=0
 x1=z//a 
 x2=z//b 
 x3=(a*b)//math.gcd(a,b) 
 p1=x1-z//x3 
 p2=x2-z//x3 
 if p1+p2>=k:
  print('Win') 
 else:
  print('Lose') 
   


for i in range(int(input())):
 z,a,b,k=list(map(int,input().split())) 
 n=0
 for j in range(1,z+1):
  if j%a==0 and j%b==0:
   pass 
  elif j%a==0:
   n+=1 
  elif j%b==0:
   n+=1 
 if n>=k:
  print('Win') 
 else:
  print('Lose') 
   


for i in range(int(input())):
 z,a,b,k=list(map(int,input().split())) 
 n=0
 for j in range(1,z+1):
  if j%a==0 and j%b==0:
   pass 
  elif j%a==0:
   n+=1 
  elif j%b==0:
   n+=1 
 if n>=k:
  print('Win') 
 else:
  print('Lose') 
   


# cook your dish here
import math
t=int(input())
while t>0:
 n,a,b,k=list(map(int,input().split()))
 l=(a*b)//math.gcd(a,b)
 c=n//b+n//a-2*(n//l)
 if c>=k:
  print("Win")
 else:
  print("Lose")
 t=t-1


# cook your dish here
t=int(input())
while t>0:
 n,a,b,k=list(map(int,input().split()))
 c=0
 for i in range(n):
  if i%a==0 and i%b!=0:
   c=c+1
  if i%b==0 and i%a!=0:
   c=c+1
 if c>=k:
  print("Win")
 else:
  print("Lose")
 t=t-1


import math
for i in range(int(input())):
 n,a,b,k=list(map(int,input().split()))
 lcm=(a*b)/math.gcd(a,b)
 #print(lcm)
 z=(n//a) + (n//b)-2*(n//lcm)
 #print(z)
 if z>=k:
  print("Win")
 else:
  print("Lose")


# cook your dish here
for i in range(int(input())):
 n,a,b,k=list(map(int,input().split()))
 s=0
 j=2
 while s<k and j<n+1:
  if j%a==0 and j%b!=0:
   s+=1
  elif j%b==0 and j%a!=0:
   s+=1
  j+=1
 if s==k:
  print("Win")
 else:
  print("Lose")



def gcd(a, b):
 if b == 0:
  return a
 return gcd(b, a%b)

for _ in range(int(input())):
 N, A, B, K = map(int, input().split())

 lcm = (A * B) // gcd(A, B)
 appy = (N // A) - (N // lcm)
 chef = (N // B) - (N // lcm)

 print("Win") if appy + chef >= K else print("Lose")

for _ in range(int(input())):
 N, A, B, K = map(int, input().split())
 cnt = 0

 for i in range(1, N+1):
  a, b = i % A, i % B
  if a == 0 and b != 0:
   cnt += 1
  elif a != 0 and b == 0:
   cnt += 1

  if cnt >= K:
   print("Win")
   break
 else:
  print("Lose")

from math import gcd as g
t=int(input())
while t!=0:
 n,a,b,k=map(int,input().split())
 lcm=(a*b)//g(a,b)
 div_a=(n//a)-(n//lcm)
 div_b=(n//b)-(n//lcm)
 net=div_a+div_b
 if net>=k:
  print('Win')
 else:
  print('Lose')
 t-=1

from math import gcd as g
t=int(input())
while t!=0:
 n,a,b,k=list(map(int,input().split()))
 lcm=(a*b)//g(a,b)
 div_a=(n//a)-(n//lcm)
 div_b=(n//b)-(n//lcm)
 net=div_a+div_b
 if net>=k:
  print('Win')
 else:
  print('Lose')
 t-=1


from math import gcd as g

t = int(input())
while t != 0:
 n, a, b, k = map(int, input().split())
 lcm = (a * b) // g(a, b)

 div_a = (n // a) - (n // lcm)
 div_b = (n // b) - (n // lcm)

 net = div_a + div_b

 if net >= k:
  print('Win')
 else:
  print('Lose')
 t -= 1

n=int(input())
for i in range(n):
  l=list(map(int,input().split()))
  l1=list(_ for _ in range(1,l[0]+1))
  count=0
  for j in l1:
    if j%l[1]==0 and j%l[2]!=0:
      count+=1
    elif j%l[1]!=0 and j%l[2]==0:
      count+=1
    if count>=l[3]:
      break
  if count>=l[3]:
    print("Win")
  else:
    print("Lose")

n=int(input())
for i in range(n):
  l=list(map(int,input().split()))
  l1=list(_ for _ in range(1,l[0]+1))
  count=0
  for j in l1:
    if j%l[1]==0 and j%l[2]!=0:
      count+=1
    elif j%l[1]!=0 and j%l[2]==0:
      count+=1
      
  if count>=l[3]:
    print("Win")
  else:
    print("Lose")

t=int(input())
for i in range(t):
 n,a,b,k=list(map(int,input().split()))
 l=[]
 p1=[]
 p2=[]
 for i in range(1,n+1):
  if(i%a==0 and i%b!=0):
   p1.append(i)
  if(i%b==0 and i%a!=0):
   p2.append(i)
 if((len(p1)+len(p2))>=k):
  print("Win")
 else:
  print("Lose")
  
   
   


from math import gcd as g

t = int(input())
while t != 0:
 n, a, b, k = map(int, input().split())
 lcm = (a * b) // g(a, b)

 div_a = (n // a) - (n // lcm)
 div_b = (n // b) - (n // lcm)

 net = div_a + div_b

 if net >= k:
  print('Win')
 else:
  print('Lose')
 t -= 1

import math
T=int(input())
for i in range(T):
 n, a, b, k = list(map(int, input().split()))
 lcm = (a * b) // math.gcd(a, b)

 div_a = (n // a) - (n // lcm)
 div_b = (n // b) - (n // lcm)

 net = div_a + div_b

 if net >= k:
  print('Win')
 else:
  print('Lose')


import math
T=int(input())
for i in range(T):
 N,A,B,K=list(map(int,input().split()))
 c=0
 lcm=(A*B)//math.gcd(A,B)
 for j in range(1,N+1):
  if j%A==0 and j%lcm!=0:
   c+=1
  elif j%B==0 and j%lcm!=0:
   c+=1
 if c>=K:
  print("Win")
 else:
  print("Lose")


T=int(input())
for i in range(T):
 N,A,B,K=list(map(int,input().split()))
 c=0
 for j in range(1,N+1):
  if j%A==0 and j%B!=0:
   c+=1
  elif j%A!=0 and j%B==0:
   c+=1
 if c>=K:
  print("Win")
 else:
  print("Lose")
   


# cook your dish here
import math
def gcd(a,b):
 if a == 0:
  return b
 return gcd(b%a,a)
def lcm(a,b):
 return (a*b)//gcd(a,b)
  
t = int(input())
while(t>0):
 n,a,b,k = map(int,input().split())
 prob = 0
 
 rem1 = n // a
 rem2 = n // b
 if a>=b:
  rem3 = n // lcm(b,a)
 else:
  rem3 = n // lcm(a,b)
 res = (rem1 - rem3) + (rem2 - rem3)
 if(res < k):
  print("Lose")
 else:
  print("Win")
 t -= 1

# cook your dish here
t = int(input())
while(t>0):
 n,a,b,k = map(int,input().split())
 prob = 0
 if(a == 1 and b == 1):
  print("Lose")
 elif(a == 1):
  rem = n // b
  prob = n - rem
  if(prob < k):
   print("Lose")
  else:
   print("Win")
 elif(b == 1):
  rem = n // a
  prob = n - rem
  if(prob < k):
   print("Lose")
  else:
   print("Win")
 else:
  for i in range(1,n+1):
   if(i%a ==0 and i%b == 0):
    continue
   elif(i%a == 0 and i%b != 0):
    prob += 1
    if(prob>=k):
     print("Win")
     break
   elif(i%b == 0 and i%a != 0):
    prob += 1
    if(prob>=k):
     print("Win")
     break
  if(prob < k):
   print("Lose")
 t -= 1

# cook your dish here
t = int(input())
while(t>0):
 n,a,b,k = map(int,input().split())
 prob = 0
 if(a == 1 and b == 1):
  print("Lose")
 # elif(a == 1):
 #     for i in range(1,n+1):
 #         if(i%a ==0 and i%b == 0):
 #             continue
 #         elif(i%a == 0 and i%b != 0):
 #             prob += 1
 #             if(prob>=k):
 #                 print("Win")
 #                 break
 # elif(b == 1):
 #     for i in range(1,n+1):
 #         if(i%a ==0 and i%b == 0):
 #             continue
 #         elif(i%b == 0 and i%a != 0):
 #             prob += 1
 #             if(prob>=k):
 #                 print("Win")
 #                 break
 else:
  for i in range(1,n+1):
   if(i%a ==0 and i%b == 0):
    continue
   elif(i%a == 0 and i%b != 0):
    prob += 1
    if(prob>=k):
     print("Win")
     break
   elif(i%b == 0 and i%a != 0):
    prob += 1
    if(prob>=k):
     print("Win")
     break
  if(prob < k):
   print("Lose")
 t -= 1

# cook your dish here
t = int(input())
while(t>0):
 n,a,b,k = map(int,input().split())
 prob = 0
 if(a == 1 and b == 1):
  print("Lose")
 else:
  for i in range(1,n+1):
   if(i%a ==0 and i%b == 0):
    continue
   elif(i%a == 0 and i%b != 0):
    prob += 1
   elif(i%b == 0 and i%a != 0):
    prob += 1
  if(prob >= k):
   print("Win")
  else:
   print("Lose")
 t -= 1

# cook your dish here
t = int(input())
while(t>0):
 n,a,b,k = map(int,input().split())
 prob = 0
 for i in range(1,n+1):
  if(i%a and i%b):
   continue
  elif(i%a or i%b):
   prob += 1
 if(prob >= k):
  print("Win")
 else:
  print("Lose")
 t -= 1