#include <bits/stdc++.h>
using namespace std;
int DP[2][7005];
int cnt[2][7005];
int N, K[2];
int V[2][7005];
void dfs(int t, int u, int wl) {
  if (DP[t][u] != 0) return;
  DP[t][u] = wl;
  if (wl == 2)
    for (int i = (0); i <= (K[1 - t] - 1); i++) {
      int nt = (u - V[1 - t][i] + N) % N;
      dfs(1 - t, nt, 3 - wl);
    }
  else {
    for (int i = 0; i < K[!t]; i++) {
      int nt = ((u - V[!t][i]) + N) % N;
      cnt[!t][nt]++;
      if (cnt[!t][nt] != K[!t]) continue;
      dfs(!t, nt, 3 - wl);
    }
  }
}
int main() {
  scanf("%d", &N);
  scanf("%d", &K[0]);
  for (int i = 0; i < K[0]; i++) scanf("%d", &V[0][i]);
  scanf("%d", &K[1]);
  for (int i = 0; i < K[1]; i++) scanf("%d", &V[1][i]);
  DP[0][0] = DP[1][0] = 2;
  for (int j = 0; j < K[0]; j++) dfs(0, ((N - V[0][j]) + N) % N, 1);
  for (int j = 0; j < K[1]; j++) dfs(1, ((N - V[1][j]) + N) % N, 1);
  for (int t = 0; t < 2; t++) {
    for (int i = 1; i < N; i++) {
      if (DP[t][i] == 1)
        printf("Win ");
      else if (DP[t][i] == 2)
        printf("Lose ");
      else
        printf("Loop ");
    }
    printf("\n");
  }
}
