#include <bits/stdc++.h>
using namespace std;
const int N = 7e3 + 5;
const int mod = 1000000000 + 7;
int dp[2][N], vis[2][N], step[2][N], n;
int get(int x, int y) {
  if (dp[x][y] != 2 || vis[x][y]) return dp[x][y];
  int sum = 0;
  vis[x][y] = 1;
  for (int i = 1; i <= step[x][0]; i++) {
    if ((step[x][i] + y) % n == 0) {
      return dp[x][y] = 1;
    }
  }
  for (int i = 1; i <= step[x][0]; i++) {
    int t = (step[x][i] + y) % n;
    int tmp = get((x ^ 1), t);
    if (tmp == -1) {
      return dp[x][y] = 1;
    } else if (tmp == 1)
      sum++;
  }
  if (sum == step[x][0]) {
    return dp[x][y] = -1;
  }
  return dp[x][y];
}
int main() {
  scanf("%d", &n);
  for (int i = 0; i < n + 5; i++) dp[0][i] = dp[1][i] = 2;
  scanf("%d", &step[0][0]);
  for (int i = 1; i <= step[0][0]; i++) scanf("%d", &step[0][i]);
  scanf("%d", &step[1][0]);
  for (int i = 1; i <= step[1][0]; i++) scanf("%d", &step[1][i]);
  for (int i = 0; i < 2; i++) {
    memset(vis, 0, sizeof vis);
    for (int j = n - 1; j >= 1; j--) {
      get(0, j);
      get(1, j);
    }
  }
  for (int i = 1; i < n; i++) {
    if (dp[0][i] == 1)
      printf("Win ");
    else if (dp[0][i] == -1)
      printf("Lose ");
    else
      printf("Loop ");
  }
  puts("");
  for (int i = 1; i < n; i++) {
    if (dp[1][i] == 1)
      printf("Win ");
    else if (dp[1][i] == -1)
      printf("Lose ");
    else
      printf("Loop ");
  }
  puts("");
  return 0;
}
