#include <bits/stdc++.h>
using namespace std;
const int maxN = 7042;
vector<int> G[2];
int dp[2][maxN], wnb[2][maxN];
queue<pair<int, int> > Q;
void print(int a) {
  if (a == -1) printf("Lose ");
  if (a == 0) printf("Loop ");
  if (a == 1) printf("Win ");
}
int main() {
  int n;
  scanf("%d", &n);
  for (int s = (0); s < (2); s++) {
    int m;
    scanf("%d", &m);
    while (m--) {
      int a;
      scanf("%d", &a);
      G[s].push_back(a);
    }
  }
  dp[0][0] = dp[1][0] = -1;
  Q.push({0, 0}), Q.push({1, 0});
  while (!Q.empty()) {
    int i, j;
    tie(i, j) = Q.front();
    Q.pop();
    for (int d : G[i ^ 1]) {
      int k = (j + n - d) % n, i2 = i ^ 1;
      if (dp[i2][k] != 0) continue;
      if (dp[i][j] == -1)
        dp[i2][k] = 1;
      else if (++wnb[i2][k] == G[i2].size())
        dp[i2][k] = -1;
      if (dp[i2][k] != 0) Q.push({i2, k});
    }
  }
  for (int s = (0); s < (2); s++) {
    for (int i = (1); i < (n); i++) print(dp[s][i]);
    printf("\n");
  }
  return 0;
}
