#include <bits/stdc++.h>
using namespace std;
int ch[102][2];
int dp[101][3][3];
int dfs(int, int, int);
int work(int x, int y, vector<vector<int> > ch, int n) {
  ch[x][y] = 1;
  for (int o = -1; o <= 1; o++) {
    int nx = x + o;
    if (nx >= 1 && nx <= n) ch[nx][y ^ 1] = 1;
  }
  int ans = 0;
  int s = -1, t = -1, cnt = 0, flag = 0;
  for (int i = 0; i <= n + 1; i++)
    if (ch[i][0] && ch[i][1]) {
      if (flag) {
        flag = 0;
        int value = dfs(cnt, s, t);
        ans ^= value;
        cnt = 0, s = -1, t = -1;
      }
    } else {
      cnt++;
      if (!ch[i][0] && !ch[i][1]) {
        t = 0;
      } else if (ch[i][0])
        t = 1;
      else
        t = 2;
      flag = 1;
      if (s == -1) s = t;
    }
  return ans;
}
int dfs(int n, int s, int t) {
  int &__ans = dp[n][s][t];
  if (__ans != -1) return __ans;
  vector<vector<int> > ch;
  for (int i = 0; i <= n + 1; i++) {
    vector<int> t(2, 0);
    ch.push_back(t);
  }
  int sg[300] = {0};
  ch[0][0] = ch[0][1] = 1;
  ch[n + 1][0] = ch[n + 1][1] = 1;
  if (s == 1)
    ch[1][0] = 1;
  else if (s == 2)
    ch[1][1] = 1;
  if (t == 1)
    ch[n][0] = 1;
  else if (t == 2)
    ch[n][1] = 1;
  for (int x = 1; x <= n; x++)
    for (int y = 0; y < 2; y++)
      if (!ch[x][y]) {
        int val = work(x, y, ch, n);
        sg[val] = 1;
      }
  for (int _ = 0;; ++_)
    if (!sg[_]) {
      dp[n][s][t] = _;
      return __ans = _;
    }
}
int main() {
  int n, m;
  cin >> n >> m;
  for (int i = 0; i < m; i++) {
    int x, y;
    cin >> x >> y;
    y -= 1;
    ch[x][y] = 1;
    for (int o = -1; o <= 1; o++) {
      int nx = x + o;
      if (nx >= 1 && nx <= n) ch[nx][y ^ 1] = 1;
    }
  }
  ch[0][0] = ch[0][1] = 1;
  ch[n + 1][0] = ch[n + 1][1] = 1;
  int ans = 0;
  int s = -1, t = -1, cnt = 0, flag = 0;
  memset(dp, -1, sizeof(dp));
  for (int i = 0; i <= n + 1; i++)
    if (ch[i][0] && ch[i][1]) {
      if (flag) {
        flag = 0;
        int value = dfs(cnt, s, t);
        ans ^= value;
        cnt = 0, s = -1, t = -1;
      }
    } else {
      cnt++;
      if (!ch[i][0] && !ch[i][1]) {
        t = 0;
      } else if (ch[i][0])
        t = 1;
      else
        t = 2;
      flag = 1;
      if (s == -1) s = t;
    }
  puts(ans ? "WIN" : "LOSE");
}
