#include <bits/stdc++.h>
using namespace std;
int dp[105][105][3][3];
int grid[105][2];
int sol(int i, int j, int up, int down) {
  if (i > j) return 0;
  if (dp[i][j][up][down] != -1) return dp[i][j][up][down];
  bool mex[255] = {0};
  if (i == j) {
    int k = i;
    if (up != 2 && down != 2) {
      if (grid[k][0] == 0 && grid[k][1] == 0 && grid[k - 1][1] == 0 &&
          grid[k + 1][1] == 0)
        mex[sol(i, k - 1, up, 1) ^ sol(k + 1, j, 1, down)] = true;
    }
    if (up != 1 && down != 1) {
      if (grid[k][1] == 0 && grid[k][0] == 0 && grid[k - 1][0] == 0 &&
          grid[k + 1][0] == 0)
        mex[sol(i, k - 1, up, 2) ^ sol(k + 1, j, 2, down)] = true;
    }
  } else {
    for (int k = i; k <= j; k++) {
      if (k == i) {
        if (up != 2) {
          if (grid[k][0] == 0 && grid[k][1] == 0 && grid[k - 1][1] == 0 &&
              grid[k + 1][1] == 0)
            mex[sol(i, k - 1, up, 1) ^ sol(k + 1, j, 1, down)] = true;
        }
        if (up != 1) {
          if (grid[k][1] == 0 && grid[k][0] == 0 && grid[k - 1][0] == 0 &&
              grid[k + 1][0] == 0)
            mex[sol(i, k - 1, up, 2) ^ sol(k + 1, j, 2, down)] = true;
        }
      } else if (k == j) {
        if (down != 2) {
          if (grid[k][0] == 0 && grid[k][1] == 0 && grid[k - 1][1] == 0 &&
              grid[k + 1][1] == 0)
            mex[sol(i, k - 1, up, 1) ^ sol(k + 1, j, 1, down)] = true;
        }
        if (down != 1) {
          if (grid[k][1] == 0 && grid[k][0] == 0 && grid[k - 1][0] == 0 &&
              grid[k + 1][0] == 0)
            mex[sol(i, k - 1, up, 2) ^ sol(k + 1, j, 2, down)] = true;
        }
      } else {
        if (grid[k][0] == 0 && grid[k][1] == 0 && grid[k - 1][1] == 0 &&
            grid[k + 1][1] == 0)
          mex[sol(i, k - 1, up, 1) ^ sol(k + 1, j, 1, down)] = true;
        if (grid[k][1] == 0 && grid[k][0] == 0 && grid[k - 1][0] == 0 &&
            grid[k + 1][0] == 0)
          mex[sol(i, k - 1, up, 2) ^ sol(k + 1, j, 2, down)] = true;
      }
    }
  }
  for (int k = 0; k <= 201; k++)
    if (!mex[k]) return dp[i][j][up][down] = k;
  return dp[i][j][up][down] = 0;
}
int main() {
  memset(dp, -1, sizeof(dp));
  memset(grid, 0, sizeof(grid));
  int r, n;
  scanf("%d %d", &r, &n);
  for (int i = 0; i < n; i++) {
    int x, y;
    scanf("%d %d", &x, &y);
    grid[x][y - 1] = 1;
  }
  if (sol(1, r, 0, 0) > 0)
    cout << "WIN" << endl;
  else
    cout << "LOSE" << endl;
}
