#include <bits/stdc++.h>
using namespace std;
int n, s[2][7050], d[2][7050];
int cnt[2][7050];
void dfs(int x, int p) {
  if (d[p][x]) return;
  d[p][x] = 1;
  if (x == 0) return;
  for (int i = 1; i <= s[!p][0]; i++) {
    int ls = (x + n - s[!p][i]) % n;
    cnt[!p][ls]++;
    if (cnt[!p][ls] == s[!p][0]) {
      d[!p][ls] = 2;
      for (int j = 1; j <= s[p][0]; j++) dfs((ls + n - s[p][j]) % n, p);
    }
  }
}
int main() {
  scanf("%d", &n);
  scanf("%d", &s[0][0]);
  for (int i = 1; i <= s[0][0]; i++) scanf("%d", &s[0][i]);
  scanf("%d", &s[1][0]);
  for (int i = 1; i <= s[1][0]; i++) scanf("%d", &s[1][i]);
  for (int i = 0; i < 2; i++)
    for (int j = 1; j <= s[i][0]; j++) dfs(n - s[i][j], i);
  for (int i = 0; i < 2; i++, puts(""))
    for (int j = 1; j < n; j++)
      if (d[i][j] == 1)
        printf("Win ");
      else if (d[i][j] == 2)
        printf("Lose ");
      else
        printf("Loop ");
}
