#include <bits/stdc++.h>
using namespace std;
int n, use[120][2], m, dp[120][4][4], ans;
int dfs(int len, int up, int dw, int ret = 0) {
  if (len < 0) return (len == -1 && up == dw && up != 3);
  if (!len) {
    if (up == 3 && dw == 3) return 0;
    if (up == 3 || dw == 3) return 1;
    return (up != dw);
  } else {
    if (dp[len][up][dw] != -1) return dp[len][up][dw];
    bool v[910] = {0};
    if (up != 3) v[dfs(len - 1, up, dw)] = 1;
    if (dw != 3) v[dfs(len - 1, up, dw)] = 1;
    for (int i = 1; i <= len; i++) {
      v[dfs(i - 2, up, 1) ^ dfs(len - i - 1, 1, dw)] = 1;
      v[dfs(i - 2, up, 2) ^ dfs(len - i - 1, 2, dw)] = 1;
    }
    int t = 0;
    for (; v[t]; t++)
      ;
    return dp[len][up][dw] = t, t;
  }
}
int main() {
  scanf("%d%d", &n, &m);
  for (int x, y; m--;) {
    scanf("%d%d", &x, &y);
    use[x][y - 1] = 1;
  }
  memset(dp, -1, sizeof(dp));
  int la = 1, up = 3, pos;
  for (int i = 1; i <= n; i++)
    if (use[i][0] || use[i][1]) {
      pos = use[i][1];
      ans ^= dfs(i - 1 - la, up, 1 << pos);
      la = i + 2, up = 1 << pos;
    }
  ans ^= dfs(n + 1 - la, up, 3);
  printf("%s\n", ans ? "WIN" : "LOSE");
}
