#include <bits/stdc++.h>
using namespace std;
long long MOD = 1000000007;
int main() {
  int len, n, i, j, k, ans;
  cin >> len >> n;
  int x[n], y[n];
  for (i = 0; i < n; i++) cin >> x[i] >> y[i];
  for (i = 0; i < n; i++) x[i]--, y[i]--;
  int arr[len + 1][2];
  for (i = 0; i < len; i++)
    for (j = 0; j < 2; j++) arr[i][j] = 0;
  for (i = 0; i < n; i++) {
    arr[x[i]][y[i]] = 1;
    if (x[i] != 0) arr[x[i] - 1][1 - y[i]] = 1;
    arr[x[i]][1 - y[i]] = 1;
    if (x[i] != (len - 1)) arr[x[i] + 1][1 - y[i]] = 1;
  }
  arr[len][0] = arr[len][1] = 1;
  int same[101], diff[101], one[101], zero[101];
  same[0] = 0;
  diff[0] = 1;
  one[0] = 1;
  zero[0] = 0;
  same[1] = 1;
  diff[1] = 0;
  one[1] = 2;
  zero[1] = 1;
  for (i = 2; i < 101; i++) {
    int v[102];
    for (j = 0; j < 102; j++) v[j] = 0;
    v[one[i - 2]] = 1;
    for (j = 0; i > 2 && j <= (i - 3); j++) v[one[j] ^ one[i - (j + 3)]] = 1;
    for (j = 0; j < 102; j++)
      if (v[j] == 0) break;
    zero[i] = j;
    for (j = 0; j < 102; j++) v[j] = 0;
    v[one[i - 1]] = v[same[i - 2]] = v[one[i - 2]] = v[1 ^ one[i - 2]] = 1;
    for (j = 0; i > 2 && j <= (i - 3); j++)
      v[same[j] ^ one[i - (3 + j)]] = v[diff[j] ^ one[i - (3 + j)]] = 1;
    for (j = 0; j < 102; j++)
      if (v[j] == 0) break;
    one[i] = j;
    for (j = 0; j < 102; j++) v[j] = 0;
    v[same[i - 2] ^ 1] = v[same[i - 1]] = v[diff[i - 2]] = 1;
    for (j = 0; i > 2 && j <= (i - 3); j++)
      v[same[j] ^ same[i - (j + 3)]] = v[diff[j] ^ diff[i - (j + 3)]] = 1;
    for (j = 0; j < 102; j++)
      if (v[j] == 0) break;
    same[i] = j;
    for (j = 0; j < 102; j++) v[j] = 0;
    v[1 ^ diff[i - 2]] = v[diff[i - 1]] = v[same[i - 2]] = 1;
    for (j = 0; i > 2 && j <= (i - 3); j++) v[same[j] ^ diff[i - (j + 3)]] = 1;
    for (j = 0; j < 102; j++)
      if (v[j] == 0) break;
    diff[i] = j;
  }
  ans = 0;
  for (i = 0; i < len;) {
    if (arr[i][0] == 0 && arr[i][1] == 0) {
      j = 0;
      while (arr[i][0] == 0 && arr[i][1] == 0) {
        j++;
        i++;
      }
      if (arr[i][0] == 1 && arr[i][1] == 1)
        ans = ans ^ zero[j];
      else {
        ans = ans ^ one[j];
        i++;
      }
    } else if (arr[i][0] == 0) {
      j = 0;
      i++;
      while (arr[i][0] == 0 && arr[i][1] == 0) {
        i++;
        j++;
      }
      if (arr[i][0] == 1 && arr[i][1] == 1)
        ans = ans ^ one[j];
      else if (arr[i][0] == 1) {
        i++;
        ans = ans ^ diff[j];
      } else {
        i++;
        ans = ans ^ same[j];
      }
    } else if (arr[i][1] == 0) {
      j = 0;
      i++;
      while (arr[i][0] == 0 && arr[i][1] == 0) {
        i++;
        j++;
      }
      if (arr[i][0] == 1 && arr[i][1] == 1)
        ans = ans ^ one[j];
      else if (arr[i][1] == 1) {
        i++;
        ans = ans ^ diff[j];
      } else {
        i++;
        ans = ans ^ same[j];
      }
    } else
      i++;
  }
  if (ans == 0)
    cout << "LOSE\n";
  else
    cout << "WIN\n";
  return 0;
}
