#include <bits/stdc++.h>
using namespace std;
const int maxn = 7e3 + 10;
int state[2][maxn];
int cnt[2][maxn];
int S[2][maxn];
bool vis[2][maxn];
int K[2];
int N;
void dfs(int p, int n) {
  if (vis[p][n]) return;
  vis[p][n] = true;
  for (int j = 0; j < K[p ^ 1]; j++) {
    int pre = (n - S[p ^ 1][j] + N) % N;
    if (pre == 0) continue;
    if (state[p][n] == 0) {
      state[p ^ 1][pre] = 1;
      dfs(p ^ 1, pre);
    }
    if (state[p][n] == 1 && ++cnt[p ^ 1][pre] == K[p ^ 1]) {
      state[p ^ 1][pre] = 0;
      dfs(p ^ 1, pre);
    }
  }
}
int main() {
  cin >> N;
  for (int i = 0; i < 2; i++) {
    cin >> K[i];
    for (int j = 0; j < K[i]; j++) cin >> S[i][j];
  }
  fill(state[0], state[0] + 2 * maxn, -1);
  state[0][0] = state[1][0] = 0;
  dfs(0, 0);
  dfs(1, 0);
  for (int i = 0; i < 2; i++) {
    for (int j = 1; j < N; j++) {
      switch (state[i][j]) {
        default:
          break;
        case 0:
          cout << "Lose ";
          break;
        case 1:
          cout << "Win ";
          break;
        case -1:
          cout << "Loop ";
          break;
      }
    }
    cout << "\n";
  }
}
