#include<bits/stdc++.h>

#define LL long long

#define fi first

#define se second

#define mk make_pair

#define pii pair<int, int>

#define y1 skldjfskldjg

#define y2 skldfjsklejg

using namespace std;

const int N =  + ;

const int M = 1e5 + ;

const int inf = 0x3f3f3f3f;

const LL INF = 0x3f3f3f3f3f3f3f3f;

const int mod = 1e9 +;

int n, m, tot, hs[N][N], match[N * N], f[N * N], ans[N * N];

int dx[] = {, }, dy[] = {, };

bool vis[N * N];

vector<int> edge[N * N];

char s[N][N];

int path(int u) {

    for(int i = ; i < edge[u].size(); i++) {

        int v = edge[u][i];

        if(!vis[v]) {

            vis[v] = true;

            if(match[v] == - || path(match[v])) {

                match[v] = u;

                return ;

            }

        }

    }

    return ;

}

void work(int u) {

    if(ans[u]) return;

    ans[u] = ;

    for(int i = ; i < edge[u].size(); i++) {

        int v = edge[u][i];

        if(match[v] != -) work(match[v]);

    }

}

int main() {

    memset(match, -, sizeof(match));

    scanf("%d%d", &n, &m);

    for(int i = ; i <= n; i++) scanf("%s", s[i] + );

    for(int i = ; i <= n; i++) {

        for(int j = ; j <= m; j++) {

            if(s[i][j] == '#') continue;

            hs[i][j] = ++tot;

            f[hs[i][j]] = (i ^ j) & ;

        }

    }

    for(int i = ; i <= n; i++) {

        for(int j = ; j <= m; j++) {

            if(s[i][j] == '#') continue;

            for(int k = ; k < ; k++) {

                int x = i + dx[k], y = j + dy[k];

                if(hs[x][y]) {

                    edge[hs[i][j]].push_back(hs[x][y]);

                    edge[hs[x][y]].push_back(hs[i][j]);

                }

            }

        }

    }

    int cnt = ;

    for(int i = ; i <= tot; i++) {

        if(f[i]) {

            memset(vis, , sizeof(vis));

            if(path(i)) cnt++;

        }

    }

    if( * cnt == tot) {

        puts("LOSE");

    } else {

        puts("WIN");

        for(int i = ; i <= tot; i++) {

            if(match[i] != -) match[match[i]] = i;

        }

        for(int i = ; i <= tot; i++) {

            if(match[i] == -) work(i);

        }

        for(int i = ; i <= n; i++) {

            for(int j = ; j <= m; j++) {

                if(ans[hs[i][j]]) printf("%d %d\n", i, j);

            }

        }

    }

    return ;

}

/*

*/