#include <bits/stdc++.h>
using namespace std;
long long mem[7070][2], cnt[7070][2];
long long s[7070][2], k[2], n;
void dfs(long long cur, long long p) {
  if (mem[cur][p]) return;
  mem[cur][p] = 2;
  if (cur == 0) return;
  for (long long i = 0; i < k[!p]; i++) {
    long long nw = (cur - s[i][!p] + n) % n;
    cnt[nw][!p]++;
    if (cnt[nw][!p] == k[!p]) {
      mem[nw][!p] = 1;
      for (long long j = 0; j < k[p]; j++) dfs((nw - s[j][p] + n) % n, p);
    }
  }
}
int main() {
  scanf("%I64d", &n);
  scanf("%I64d", &k[0]);
  for (long long i = 0; i < k[0]; i++) scanf("%I64d", &s[i][0]);
  scanf("%I64d", &k[1]);
  for (long long i = 0; i < k[1]; i++) scanf("%I64d", &s[i][1]);
  for (long long i = 0; i < 2; i++)
    for (long long j = 0; j < k[i]; j++) dfs(n - s[j][i], i);
  for (long long i = 0; i < 2; i++) {
    for (long long j = 1; j <= n - 1; j++) {
      if (mem[j][i] == 2)
        printf("Win");
      else if (mem[j][i] == 1)
        printf("Lose");
      else
        printf("Loop");
      if (j == n - 1)
        printf("\n");
      else
        printf(" ");
    }
  }
  return 0;
}
