#include <iostream>
#include <algorithm>
#include <vector>
#include <set>
#include <cmath>
#include <stdio.h>
#include <sstream>
#include <queue>

using namespace std;

#define file(s) freopen(s".in","r",stdin); freopen(s".out","w",stdout)
#define fast ios_base::sync_with_stdio(false),cin.tie(false),cout.tie(false)
#define endl '\n'

int dp[25][25][25][25];
vector <int> a;
vector <int> b;

int main()
{
    fast;
    //file("game");
    int n,m;
    cin >> n >> m;
    a.resize(n);
    b.resize(m);
    for (int i = 0; i < n; i++)
        cin >> a[i];
    for (int j = 0; j < m; j++)
        cin >> b[j];
    for (int l1 = 0; l1 < n; l1++)
        for (int r1 = l1; r1 <= n; r1++)
            for (int l2 = 0; l2 < m; l2++)
                for (int r2 = l2; r2 <= m; r2++)
                {
                    vector <bool> f;
                    f.assign(25,0);
                    for (int mid1 = l1; mid1 < r1; mid1++)
                        for (int mid2 = l2; mid2 < r2; mid2++)
                            f[dp[l1][mid1][l2][mid2] ^ dp[mid1+1][r1][mid2+1][r2]] = true;
                    int t = 0;
                    while (f[t]) t++;
                    dp[l1][r1][l2][r2] = t;
                }
    if (!dp[0][n][0][m]) return cout << "LOSE" << endl, 0;
}