#include<stdio.h>
#include<string.h>
#include<set>
using namespace std;
int sg[205][205];
int solve(int w,int h){
if(sg[w][h]!=-1){
return sg[w][h];
}
set<int> my_set;
for(int i=2;w-i>=2;i++){
my_set.insert(solve(i,h)^solve(w-i,h));
}
for(int j=2;h-j>=2;j++){
my_set.insert(solve(w,j)^solve(w,h-j));
}
int g=0;
while(my_set.count(g)){
g++;
}
return sg[w][h]=g;
}
int main(){
int w,h;
memset(sg,-1,sizeof(sg));
while(~scanf("%d%d",&w,&h)){
if(solve(w,h)){
puts("WIN");
}
else{
puts("LOSE");
}
}
}
#include<string.h>
#include<set>
using namespace std;
int sg[205][205];
int solve(int w,int h){
if(sg[w][h]!=-1){
return sg[w][h];
}
set<int> my_set;
for(int i=2;w-i>=2;i++){
my_set.insert(solve(i,h)^solve(w-i,h));
}
for(int j=2;h-j>=2;j++){
my_set.insert(solve(w,j)^solve(w,h-j));
}
int g=0;
while(my_set.count(g)){
g++;
}
return sg[w][h]=g;
}
int main(){
int w,h;
memset(sg,-1,sizeof(sg));
while(~scanf("%d%d",&w,&h)){
if(solve(w,h)){
puts("WIN");
}
else{
puts("LOSE");
}
}
}