#include <bits/stdc++.h>
using namespace std;
int N, D[100100][3], check[100100][3], a[100100], b[100100], K1, K2;
const int inf = 1e9;
queue<pair<int, int> > Q;
void BFS() {
  int i;
  while (!Q.empty()) {
    pair<int, int> X = Q.front();
    if (X.second == 0) {
      if (D[X.first][X.second] == inf) {
        for (i = 0; i < K2; i++) {
          int nx = (X.first - b[i] + N - 1) % N + 1;
          if (check[nx][1] == 1) continue;
          D[nx][1]++;
          if (D[nx][1] == K2) {
            D[nx][1] = -1;
            check[nx][1] = 1;
            Q.push(make_pair(nx, 1));
          }
        }
      } else {
        for (i = 0; i < K2; i++) {
          int nx = (X.first - b[i] + N - 1) % N + 1;
          if (check[nx][1] == 1) continue;
          D[nx][1] = inf;
          if (!check[nx][1]) Q.push(make_pair(nx, 1));
          check[nx][1] = 1;
        }
      }
    } else {
      if (D[X.first][X.second] == inf) {
        for (i = 0; i < K1; i++) {
          int nx = (X.first - a[i] + N - 1) % N + 1;
          if (check[nx][0] == 1) continue;
          D[nx][0]++;
          if (D[nx][0] == K1) {
            check[nx][0] = 1;
            D[nx][0] = -1;
            Q.push(make_pair(nx, 0));
          }
        }
      } else {
        for (i = 0; i < K1; i++) {
          int nx = (X.first - a[i] + N - 1) % N + 1;
          if (check[nx][0] == 1) continue;
          D[nx][0] = inf;
          if (!check[nx][0]) Q.push(make_pair(nx, 0));
          check[nx][0] = 1;
        }
      }
    }
    Q.pop();
  }
}
int main() {
  int i, j;
  cin >> N;
  cin >> K1;
  for (i = 0; i < K1; i++) {
    cin >> a[i];
    D[(-a[i] + N) % N + 1][0] = inf;
    check[(-a[i] + N) % N + 1][0] = 1;
    Q.push(make_pair((-a[i] + N) % N + 1, 0));
  }
  cin >> K2;
  for (i = 0; i < K2; i++) {
    cin >> b[i];
    D[(-b[i] + N) % N + 1][1] = inf;
    check[(-b[i] + N) % N + 1][1] = 1;
    Q.push(make_pair((-b[i] + N) % N + 1, 1));
  }
  BFS();
  for (i = 2; i <= N; i++) {
    if (check[i][0] == 1) {
      if (D[i][0] == inf)
        cout << "Win ";
      else
        cout << "Lose ";
    } else {
      cout << "Loop ";
    }
  }
  cout << "\n";
  for (i = 2; i <= N; i++) {
    if (check[i][1] == 1) {
      if (D[i][1] == inf)
        cout << "Win ";
      else
        cout << "Lose ";
    } else {
      cout << "Loop ";
    }
  }
}
