#include <algorithm>

#include <bitset>

#include <cctype>

#include <cerrno>

#include <clocale>

#include <cmath>

#include <complex>

#include <cstdio>

#include <cstdlib>

#include <cstring>

#include <ctime>

#include <deque>

#include <exception>

#include <fstream>

#include <functional>

#include <limits>

#include <list>

#include <map>

#include <iomanip>

#include <ios>

#include <iosfwd>

#include <iostream>

#include <istream>

#include <ostream>

#include <queue>

#include <set>

#include <sstream>

#include <stdexcept>

#include <streambuf>

#include <string>

#include <utility>

#include <vector>

#include <cwchar>

#include <cwctype>

#include <stack>

#include <limits.h>

using namespace std;

#define MAXN 210

int n,m;

int sg[MAXN][MAXN];

inline int getSG(int n,int m)

{

        int i;

        bool s[];

        if (sg[n][m] != -) return sg[n][m];

        memset(s,false,sizeof(s));

        for (i = ; i <= n - ; i++) s[getSG(n-i,m)^getSG(i,m)] = true;

        for (i = ; i <= m - ; i++) s[getSG(n,i)^getSG(n,m-i)] = true;

        for (i = ; ; i++)

        {

                if (!s[i])

                        return sg[n][m] = i;

        }

}

int main()

{

        memset(sg,,sizeof(sg));

        while (scanf("%d%d",&n,&m) != EOF)

        {

                printf(getSG(n,m)?"WIN\n":"LOSE\n");

        }

        return ;

}