#include <bits/stdc++.h>
using namespace std;
int g[102][102][3][3];
bool f[102][2];
int solve(int x1, int x2, int s1, int s2) {
  if (x1 > x2) return 0;
  int &ret = g[x1][x2][s1][s2];
  if (ret != -1) return ret;
  set<int> S;
  for (int x = x1; x <= x2; x++)
    for (int y = 0; y < 2; y++) {
      if (f[x][0] || f[x][1]) continue;
      if (x == x1 && (1 - y) + 1 == s1) continue;
      if (x == x2 && (1 - y) + 1 == s2) continue;
      if (x != x1 && f[x - 1][1 - y]) continue;
      if (x != x2 && f[x + 1][1 - y]) continue;
      S.insert((solve(x1, x - 1, s1, y + 1)) ^ (solve(x + 1, x2, y + 1, s2)));
    }
  int aa = 0;
  while (S.find(aa) != S.end()) aa++;
  return ret = aa;
}
int main() {
  int n, m;
  scanf("%d", &n);
  scanf("%d", &m);
  memset(f, 0, sizeof f);
  while (m--) {
    int x, y;
    scanf("%d", &x);
    scanf("%d", &y);
    y--;
    f[x][y] = 1;
  }
  memset(g, -1, sizeof g);
  puts(solve(1, n, 0, 0) == 0 ? "LOSE" : "WIN");
  return 0;
}
