#include <bits/stdc++.h>
using namespace std;
const int maxn = 7000 + 10;
int n, k[2], s[2][maxn], num[2][maxn], f[2][maxn];
inline void get_ready() {
  cin >> n;
  for (int i = (0); i <= (1); i++) {
    scanf("%d", &k[i]);
    for (int j = (1); j <= (k[i]); j++) {
      scanf("%d", &s[i][j]);
    }
  }
}
inline void dfs(int x, int y) {
  if (f[x][y] == 1) {
    x ^= 1;
    for (int i = (1); i <= (k[x]); i++) {
      int yy = y - s[x][i];
      if (yy <= 0) yy += n;
      if (!f[x][yy]) {
        f[x][yy] = 2;
        dfs(x, yy);
      }
    }
  } else {
    x ^= 1;
    for (int i = (1); i <= (k[x]); i++) {
      int yy = y - s[x][i];
      if (yy <= 0) yy += n;
      num[x][yy]++;
      if (!f[x][yy] && num[x][yy] == k[x]) {
        f[x][yy] = 1;
        dfs(x, yy);
      }
    }
  }
}
inline void solve() {
  f[0][1] = f[1][1] = 1;
  dfs(0, 1);
  dfs(1, 1);
  for (int i = (0); i <= (1); i++) {
    for (int j = (2); j <= (n); j++)
      if (f[i][j] == 1)
        cout << "Lose ";
      else if (f[i][j] == 2)
        cout << "Win ";
      else
        cout << "Loop ";
    cout << endl;
  }
}
int main() {
  get_ready();
  solve();
  return 0;
}
