#include <bits/stdc++.h>
using namespace std;
int n, k[5], i, j;
int f[5][10000], c[5][10000], s[5][10000];
void dfs(int t, int x) {
  int i, j, y;
  f[t][x] = 0;
  for (i = 1; i <= k[3 - t]; i++) {
    y = (x - s[3 - t][i] + n) % n;
    if (f[3 - t][y] == -1) {
      f[3 - t][y] = 1;
      for (j = 1; j <= k[t]; j++) c[t][(y - s[t][j] + n) % n]++;
    }
  }
  for (i = 1; i < n; i++)
    if (c[t][i] == k[t] && f[t][i] == -1) dfs(t, i);
}
int main() {
  scanf("%d", &n);
  scanf("%d", &k[1]);
  for (i = 1; i <= k[1]; i++) scanf("%d", &s[1][i]);
  scanf("%d", &k[2]);
  for (i = 1; i <= k[2]; i++) scanf("%d", &s[2][i]);
  memset(f, -1, sizeof(f));
  memset(c, 0, sizeof(c));
  f[1][0] = 0;
  f[2][0] = 0;
  dfs(1, 0);
  dfs(2, 0);
  for (j = 1; j <= 2; j++) {
    for (i = 1; i < n; i++) {
      if (f[j][i] == 0) printf("Lose ");
      if (f[j][i] == 1) printf("Win ");
      if (f[j][i] == -1) printf("Loop ");
    }
    printf("\n");
  }
}
