#include <bits/stdc++.h>
using namespace std;
const int maxn = 7e3 + 10;
int dp[2][maxn], cnt[2][maxn], v[2][maxn], n, k[3], win = 1, lose = 2;
void dfs(int t, int u, int wl) {
  if (dp[t][u] != 0) return;
  dp[t][u] = wl;
  if (wl == lose) {
    for (int i = 0; i < k[!t]; i++) {
      int p = ((u - v[!t][i]) + n) % n;
      dfs(!t, p, 3 - wl);
    }
  } else {
    for (int i = 0; i < k[!t]; i++) {
      int p = ((u - v[!t][i]) + n) % n;
      cnt[!t][p]++;
      if (cnt[!t][p] != k[!t]) continue;
      dfs(!t, p, 3 - wl);
    }
  }
}
void dfs_all() {
  for (int i = 0; i < 2; i++)
    for (int j = 0; j < k[i]; j++) dfs(i, ((n - v[i][j]) + n) % n, win);
}
int main() {
  ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
  cin >> n >> k[0];
  for (int i = 0; i < k[0]; i++) cin >> v[0][i];
  cin >> k[1];
  for (int i = 0; i < k[1]; i++) cin >> v[1][i];
  dp[0][0] = lose, dp[1][0] = lose;
  dfs_all();
  for (int t = 0; t < 2; t++) {
    for (int i = 1; i < n; i++) {
      if (dp[t][i] == win)
        cout << "Win ";
      else if (dp[t][i] == lose)
        cout << "Lose ";
      else
        cout << "Loop ";
    }
    cout << "\n";
  }
}
