#include <bits/stdc++.h>
using namespace std;
int R, N;
pair<int, int> bad[110];
int main() {
  cin >> R >> N;
  for (int i = 0; i < N; i++) cin >> bad[i].first >> bad[i].second;
  sort(bad, bad + N);
  cout << (((N == 0) ? R % 2
                     : (bad[0].first - 1) ^ (R - bad[N - 1].first) ^
                           ((bad[0].first + bad[N - 1].first + bad[0].second +
                             bad[N - 1].second + N - 1) %
                            2))
               ? "WIN\n"
               : "LOSE\n");
  return 0;
}
