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