#include <bits/stdc++.h>
using namespace std;
const int N = 7e3 + 10, M = 1510, mod = 1e9 + 7;
inline int read() {
  register int x = 0, f = 0;
  register char c = getchar();
  while (c < '0' || c > '9') f |= c == '-', c = getchar();
  while (c >= '0' && c <= '9') x = (x << 3) + (x << 1) + c - '0', c = getchar();
  return f ? -x : x;
}
int n;
int k[2], s[2][N], cnt[2][N], vis[2][N], win[2][N];
void dfs(int v, int now) {
  if (vis[v][now]) return;
  vis[v][now] = 1;
  int u = v ^ 1;
  for (int i = 1; i <= k[u]; ++i) {
    int pre = (now - s[u][i] + n - 1) % n + 1;
    if (pre == 1) continue;
    if (!win[v][now])
      win[u][pre] = 1, dfs(u, pre);
    else if (++cnt[u][pre] == k[u])
      win[u][pre] = 0, dfs(u, pre);
  }
  return;
}
int main() {
  n = read();
  for (int i = 0; i < 2; ++i) {
    k[i] = read();
    for (int j = 1; j <= k[i]; ++j) s[i][j] = read();
  }
  dfs(0, 1), dfs(1, 1);
  for (int i = 0; i < 2; ++i)
    for (int j = 2; j <= n; ++j)
      printf("%s%c", vis[i][j] ? win[i][j] ? "Win" : "Lose" : "Loop",
             " \n"[j == n]);
  return 0;
}
