#include <bits/stdc++.h>
using namespace std;
const int maxn = 7007;
int dp[2][maxn] = {}, n, deg[2][maxn] = {};
vector<int> adj[2];
void dfs(int tp, int pl) {
  tp ^= 1;
  for (auto it : adj[tp]) {
    int v = pl - it;
    if (v <= 0) v += n;
    if (dp[tp][v]) continue;
    if (dp[1 - tp][pl] == 1) {
      --deg[tp][v];
      if (deg[tp][v] == 0) dp[tp][v] = 2, dfs(tp, v);
    } else
      dp[tp][v] = 1, dfs(tp, v);
  }
}
int main() {
  ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
  cin >> n;
  for (int i = 0; i < 2; ++i) {
    int k, s;
    cin >> k;
    while (k--) {
      cin >> s;
      adj[i].push_back(s);
    }
  }
  for (int i = 0; i < 2; ++i)
    for (int j = 1; j <= n; ++j) deg[i][j] = (int)adj[i].size();
  dp[0][1] = dp[1][1] = 2;
  dfs(0, 1);
  dfs(1, 1);
  for (int i = 0; i < 2; ++i, cout << '\n')
    for (int j = 2; j <= n; ++j)
      cout << (dp[i][j] ? (dp[i][j] == 1 ? "Win" : "Lose") : "Loop") << ' ';
  return 0;
}
