#include<iostream>
using namespace std;
int main()
{
int T,n,m;
cin>>T;
while(T--){
cin>>n>>m;
if(n%(m+1)==0)cout<<"Lose"<<endl;
else cout<<"Win"<<endl;
}
return 0;
}
#include<iostream>
using namespace std;
int main()
{
int T,k,n,m,ans;
cin>>T;
while(T--){
ans=0;
cin>>k;
while(k--){
cin>>n>>m;
ans^=(n%(m+1));
}
if(ans)cout<<"Win"<<endl;
else cout<<"Lose"<<endl;
}
return 0;
}
#include<iostream>
#include<cstring>
using namespace std;
const int N=1e2+1;
int t[N];
int main()
{
int n,flag,a;
while(cin>>n,n){
memset(t,0,sizeof(t));
flag=0;
while(n--){
cin>>a;
t[a]++;
}
for(int i=1;i<=100;++i)
if(t[i]&1){
flag=1;
break;
}
if(!flag)cout<<"Lose"<<endl;
else cout<<"Win"<<endl;
}
return 0;
}
#include<iostream>
#include<cmath>
#include<algorithm>
using namespace std;
int main()
{
int a,b;
while(cin>>a>>b){
if(a>b)swap(a,b);
double k=b-a;
if(a==(int)(k*(sqrt(5.0)+1)/2))
cout<<0<<endl;
else cout<<1<<endl;
}
return 0;
}
#include<bits/stdc++.h>
using namespace std;
typedef unsigned long long LL;
int main()
{
LL f[111];
f[1]=1;
f[2]=2;
for(int i=3;i<=92;++i)
f[i]=f[i-1]+f[i-2];
LL n;
while(cin>>n){
int i;
for(i=2;i<=92;++i)
if(f[i]==n)break;
if(i==93)cout<<"Yes"<<endl;
else cout<<"No"<<endl;
}
return 0;
}
#include<bits/stdc++.h>
using namespace std;
int main()
{
ios::sync_with_stdio(false);cin.tie();
int T,ans,a,n;
cin>>T;
while(T--){
ans=0;
cin>>n;
while(n--){
cin>>a;
ans^=a;
}
if(ans)cout<<"PIAOYI"<<endl;
else cout<<"HRDV"<<endl;
}
return 0;
}
#include<bits/stdc++.h>
using namespace std;
int main()
{
int n;
while(cin>>n){
if(n==1||n==2)cout<<"Hrdv"<<endl;
else cout<<"Yougth"<<endl;
}
return 0;
}
#include<iostream>
#include<cmath>
#include<algorithm>
using namespace std;
int main()
{
int a,b;
while(cin>>a>>b){
if(!a&&!b)break;
if(a>b)swap(a,b);
int t=b-a;
int k=t*(sqrt(5.0)+1)/2;
if(k==a)cout<<0<<endl;
else{
cout<<1<<endl;
if(a>=k&&(a-k==b-k-t))cout<<k<<" "<<k+t<<endl;
for(int i=1;i*(sqrt(5.0)+1)/2<=b;++i){
int A=i*(sqrt(5.0)+1)/2;
int B=A+i;
if(a==A&&b>B)cout<<a<<" "<<B<<endl;
else if(a>A&&b==B)cout<<A<<" "<<B<<endl;
else if(a==B&&b>a)cout<<A<<" "<<a<<endl;
}
}
}
return 0;
}
#include<bits/stdc++.h>
using namespace std;
int main()
{
int T,n,a,ans,num;
cin>>T;
while(T--){
ans=num=0;
cin>>n;
while(n--){
cin>>a;
if(a==0)continue;
ans^=a;
if(a>1)num++;
}
if((ans&&!num)||(!ans&&num))cout<<"Hrdv"<<endl;
else cout<<"Yougth"<<endl;
}
return 0;
}
#include<cstdio>
#include<cstring>
using namespace std;
const int N=1e3+9;
bool vis[N];
int sg[N],f[N],SG[N],F[N];
void get()
{
f[1]=1;
f[2]=2;
for(int i=3;i<=15;++i)
f[i]=f[i-1]+f[i-2];
sg[0]=0;
for(int i=1;i<=1000;++i){
memset(vis,false,sizeof(vis));
int j=1;
while(f[j]<=i&&j<=15){
vis[sg[i-f[j]]]=true;
++j;
}
j=0;
while(vis[j])++j;
sg[i]=j;
}
F[0]=1;
for(int i=1;i<=500;++i)
F[i]=2*i;
SG[0]=0;
for(int i=1;i<=1000;++i){
memset(vis,false,sizeof(vis));
int j=0;
while(F[j]<=i&&j<=500){
vis[SG[i-F[j]]]=true;
++j;
}
j=0;
while(vis[j])++j;
SG[i]=j;
}
}
int main()
{
get();
int n,k,ans,a;
while(~scanf("%d",&n)){
if(!n)break;
k=ans=0;
while(n--){
scanf("%d",&a);
++k;
if(k==1)ans^=(a%3);
else if(k==2)ans^=sg[a];
else if(k==3)ans^=a;
else if(k==4)ans^=SG[a];
else if(k==5)ans^=(a%2);
else ans^=(a%(k+1));
}
if(ans)printf("Yougth\n");
else printf("Hrdv\n");
}
return 0;
}