#include #define MOD 1000000007 #define INF (1<<30) #define INFL (1<<62) #define pe(str) return cout<<(str)<=0;i--) #define rep(i,a,b) for(int i=(a);i<(b);i++) #define rrep(i,a,b) for(int i=(b);i>=(a);i--) #define bw(a,b,c) (((a)<=(b))&&((b)<=(c))) #define hello cout<<"hello"<>n #define EPS 1e-6 #define EPSIN(a,b) ((b)-EPS<=(a)&&(a)<=(b)+EPS) using namespace std; typedef long long ll; typedef unsigned long long ull; typedef long double ld; typedef pair pii; typedef complex point; template void dump(InputIterator first,InputIterator last,char delim=' '){ for(InputIterator it=first;it!=last;it++){ if(it!=first)cout< void swp(T &a,T &b){ T t=a; a=b; b=t; } int main(void){ int p; int n,k; int dp[120001]; cin>>p; while(p--){ cin>>n>>k; for(int i=IF(n-(k+1)>=0,n-(k+1),0);i<=n-2;i++)dp[i]=1; // katenai for(int i=n-(k+2);i>=0;i--){ bool f=false; for(int j=1;j<=k&&i+j<=n&&!f;j++) if(!dp[i+j]) f=true; dp[i]=f; } cout<<(dp[0]?"Win":"Lose")<