#include <bits/stdc++.h>
int n, k[2], s[2][7008];
int win[2][7008], sch[2][7008], cnt[2][7008];
void init(int who) {
  memset(win[who], 0, sizeof(int) * n);
  memset(sch[who], 0, sizeof(int) * n);
  memset(cnt[who], 0, sizeof(int) * n);
}
void dp(int now, int who) {
  sch[!who][now] = 1;
  for (int i = 0; i != k[who]; ++i) {
    int pre = (now - s[who][i] + n) % n;
    if (!pre) continue;
    if (sch[who][pre]) continue;
    if (!win[!who][now]) {
      win[who][pre] = 1;
      dp(pre, !who);
    } else if (win[!who][now]) {
      if (++cnt[who][pre] == k[who]) {
        dp(pre, !who);
      }
    }
  }
}
int main() {
  scanf("%d", &n);
  for (int who = 0; who != 2; ++who) {
    scanf("%d", k + who);
    for (int i = 0; i != k[who]; ++i) scanf("%d", s[who] + i);
  }
  init(0), init(1);
  dp(0, 0), dp(0, 1);
  for (int who = 0; who != 2; ++who) {
    for (int i = 1; i != n; ++i) {
      if (win[who][i])
        printf("Win");
      else if (sch[who][i])
        printf("Lose");
      else
        printf("Loop");
      printf("%c", " \n"[i == n - 1]);
    }
  }
  return 0;
}
