#include <bits/stdc++.h>
using namespace std;
int pp[100010];
int qq;
int calc() {
  if (qq == 0) return 0;
  sort(pp, pp + qq);
  if (pp[0] != 0) return 0;
  pp[qq++] = 1000000;
  for (int i = 1; i < qq; i++)
    if (pp[i] - pp[i - 1] > 1) return pp[i - 1] + 1;
  return -1;
}
int sg[3][3][110];
void init() {
  memset(sg, 0, sizeof(sg));
  for (int i = 0; i <= 2; i++)
    for (int j = 0; j <= 2; j++) sg[i][j][1] = 1;
  sg[1][2][1] = 0;
  sg[2][1][1] = 0;
  for (int k = 2; k <= 100; k++)
    for (int i = 0; i <= 2; i++)
      for (int j = 0; j <= 2; j++) {
        qq = 0;
        for (int t = 1; t <= k; t++) {
          int l = t - 1;
          int r = k - t;
          if ((i != 2 || l != 0) && (j != 2 || r != 0)) {
            pp[qq++] = sg[i][1][l] ^ sg[1][j][r];
          }
          if ((i != 1 || l != 0) && (j != 1 || r != 0)) {
            pp[qq++] = sg[i][2][l] ^ sg[2][j][r];
          }
        }
        sg[i][j][k] = calc();
      }
}
pair<int, int> s[1000010];
int main() {
  init();
  int n, r;
  scanf("%d %d", &n, &r);
  for (int i = 0; i < r; i++) scanf("%d %d", &s[i].first, &s[i].second);
  s[r++] = make_pair(0, 0);
  s[r++] = make_pair(n + 1, 0);
  sort(s, s + r);
  int ans = 0;
  for (int i = 1; i < r; i++) {
    ans ^= sg[s[i - 1].second][s[i].second][s[i].first - s[i - 1].first - 1];
  }
  if (ans > 0)
    printf("WIN\n");
  else
    printf("LOSE\n");
  return 0;
}
