#include <bits/stdc++.h>
using namespace std;
const int lose = 1, win = 2;
int cur[2][7111];
int k[2];
int what[2][7111];
int dp[2][7111];
int n;
void f(int p, int q, int r) {
  if (dp[p][q]) return;
  dp[p][q] = r;
  int i;
  if (r == lose) {
    for (i = 1; i <= k[!p]; i++) {
      f(!p, (q + n - what[!p][i]) % n, win);
    }
  } else {
    for (i = 1; i <= k[!p]; i++) {
      if (!--cur[!p][(q + n - what[!p][i]) % n])
        f(!p, (q + n - what[!p][i]) % n, lose);
    }
  }
}
int main() {
  int i;
  scanf("%d", &n);
  scanf("%d", &k[0]);
  for (i = 1; i <= k[0]; i++) scanf("%d", &what[0][i]);
  for (i = 0; i < n; i++) cur[0][i] = k[0];
  scanf("%d", &k[1]);
  for (i = 1; i <= k[1]; i++) scanf("%d", &what[1][i]);
  for (i = 0; i < n; i++) cur[1][i] = k[1];
  dp[0][0] = lose, dp[1][0] = lose;
  for (i = 1; i <= k[0]; i++) f(0, (n - what[0][i]) % n, win);
  for (i = 1; i <= k[1]; i++) f(1, (n - what[1][i]) % n, win);
  for (int x = 0; x < 2; x++) {
    for (i = 1; i < n; i++) {
      if (dp[x][i] == win)
        printf("Win ");
      else if (dp[x][i] == lose)
        printf("Lose ");
      else
        printf("Loop ");
    }
    printf("\n");
  }
}
