#include <bits/stdc++.h>
using namespace std;
long long n, a[2][7001], c[2][7001];
bool b1[2][7001], b2[2][7001];
inline long long read() {
  long long sum = 0, x = 1;
  char ch = getchar();
  while (ch < '0' || ch > '9') {
    if (ch == '-') x = -1;
    ch = getchar();
  }
  while (ch >= '0' && ch <= '9') {
    sum = sum * 10 + ch - '0';
    ch = getchar();
  }
  return sum * x;
}
inline void dfs(long long v, long long x) {
  if (b1[v][x]) return;
  b1[v][x] = 1;
  long long u = v ^ 1;
  for (register long long i = 1; i <= a[u][0]; ++i) {
    long long w = (x - a[u][i] + n - 1) % n + 1;
    if (w == 1) continue;
    if (!b2[v][x]) {
      b2[u][w] = 1;
      dfs(u, w);
    } else if (++c[u][w] == a[u][0]) {
      b2[u][w] = 0;
      dfs(u, w);
    }
  }
}
signed main() {
  n = read();
  for (register long long i = 0; i <= 1; ++i) {
    a[i][0] = read();
    for (register long long j = 1; j <= a[i][0]; ++j) a[i][j] = read();
  }
  dfs(0, 1);
  dfs(1, 1);
  for (register long long i = 0; i <= 1; ++i) {
    for (register long long j = 2; j <= n; ++j)
      printf("%s ", b1[i][j] ? b2[i][j] ? "Win" : "Lose" : "Loop");
    putchar('\n');
  }
  return 0;
}
