#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using pii = pair<int, int>;
int const N = 100 + 20;
int n, k, val[N], last, res;
int dp[4][N];
int mark[4 * N];
void pre() {
  for (int i = 1; i < N; i++) {
    for (int j = 1; j < i - 2; j++) {
      int g = dp[2][j + 1] ^ dp[3][i - j];
      mark[g] = 4 * i + 3;
    }
    while (mark[dp[3][i]] == 4 * i + 3) dp[3][i]++;
    for (int j = 1; j < i - 1; j++) {
      int g = dp[2][j + 1] ^ dp[2][i - j];
      mark[g] = 4 * i + 2;
      if (1 < j && j < i - 2) {
        int g = dp[3][j + 1] ^ dp[3][i - j];
        mark[g] = 4 * i + 2;
      }
    }
    while (mark[dp[2][i]] == 4 * i + 2) dp[2][i]++;
    for (int j = 1; j < i; j++) {
      int g = dp[2][j + 1] ^ dp[1][i - j];
      mark[g] = 4 * i + 1;
      if (1 < j) {
        int g = dp[3][j + 1] ^ dp[1][i - j];
        mark[g] = 4 * i + 1;
      }
    }
    while (mark[dp[1][i]] == 4 * i + 1) dp[1][i]++;
    for (int j = 0; j < i; j++) {
      int g = dp[1][j + 1] ^ dp[1][i - j];
      mark[g] = 4 * i + 4;
    }
    while (mark[dp[0][i]] == 4 * i + 4) dp[0][i]++;
  }
}
int main() {
  ios::sync_with_stdio(false), cin.tie(0), cout.tie(0);
  pre();
  cin >> n >> k;
  if (!k) return cout << (dp[0][n] ? "WIN" : "LOSE") << '\n', 0;
  for (int i = 0, x, y; i < k; i++) {
    cin >> x >> y;
    x--;
    val[x] = y;
  }
  last = 0;
  for (int i = 0; i < n; i++) {
    if (val[i] && i != last) {
      if (!last && !val[0])
        res ^= dp[1][i + 1];
      else {
        if (val[i] == val[last])
          res ^= dp[2][i - last + 1];
        else
          res ^= dp[3][i - last + 1];
      }
      last = i;
    }
  }
  if (last < n - 1) res ^= dp[1][n - last];
  cout << (res ? "WIN" : "LOSE") << '\n';
}
