#include <bits/stdc++.h>
const int kN = 7005;
int n, k[2], s[2][kN], num[2][kN];
bool win[2][kN], vis[2][kN];
void dfs(int u, int cur) {
  if (vis[u][cur]) return;
  vis[u][cur] = true;
  for (int i = 1; i <= k[u ^ 1]; ++i) {
    int lst =
        (cur - s[u ^ 1][i] >= 1
             ? cur - s[u ^ 1][i] > n ? cur - s[u ^ 1][i] - n : cur - s[u ^ 1][i]
             : cur - s[u ^ 1][i] + n);
    if (lst == 1) continue;
    if (!win[u][cur]) {
      win[u ^ 1][lst] = true;
      dfs(u ^ 1, lst);
    } else if (++num[u ^ 1][lst] >= k[u ^ 1]) {
      dfs(u ^ 1, lst);
    }
  }
}
int main() {
  scanf("%d", &n);
  scanf("%d", &k[0]);
  for (int i = 1; i <= k[0]; ++i) scanf("%d", &s[0][i]);
  scanf("%d", &k[1]);
  for (int i = 1; i <= k[1]; ++i) scanf("%d", &s[1][i]);
  dfs(0, 1);
  dfs(1, 1);
  for (int i = 2; i <= n; ++i)
    printf("%s ", vis[0][i] ? win[0][i] ? "Win" : "Lose" : "Loop");
  printf("\n");
  for (int i = 2; i <= n; ++i)
    printf("%s ", vis[1][i] ? win[1][i] ? "Win" : "Lose" : "Loop");
  return 0;
}
