#include <bits/stdc++.h>
using namespace std;
int n, r;
pair<int, int> block[105];
int atas, bawah, tengah;
int ganjil;
int main() {
  scanf("%d %d", &r, &n);
  for (int i = 0; i < n; i++) scanf("%d %d", &block[i].first, &block[i].second);
  if (n == 0) {
    if (r % 2 == 0)
      printf("LOSE\n");
    else
      printf("WIN\n");
  } else {
    sort(block, block + n);
    atas = block[0].first - 1;
    bawah = r - block[n - 1].first;
    if (block[0].second == block[n - 1].second)
      tengah = (block[n - 1].first + block[0].first + n - 1) % 2;
    else
      tengah = (block[n - 1].first + block[0].first + n) % 2;
    if (atas ^ bawah ^ tengah)
      printf("WIN\n");
    else
      printf("LOSE\n");
  }
  return 0;
}
