#include <bits/stdc++.h>
using namespace std;
int n, k[2], a[2][7005], cnt[2][7005];
bool vis[2][7005], win[2][7005];
void dfs(int v, int now) {
  if (vis[v][now]) return;
  vis[v][now] = 1;
  int u = v ^ 1, i, p;
  for (i = 1; i <= k[u]; i++) {
    p = (now - a[u][i] + n - 1) % n + 1;
    if (p == 1) continue;
    if (!win[v][now]) {
      win[u][p] = 1;
      dfs(u, p);
    } else if (++cnt[u][p] == k[u]) {
      win[u][p] = 0;
      dfs(u, p);
    }
  }
}
int main() {
  int i, o;
  cin >> n;
  for (o = 0; o <= 1; o++) {
    cin >> k[o];
    for (i = 1; i <= k[o]; i++) cin >> a[o][i];
  }
  dfs(0, 1);
  dfs(1, 1);
  for (o = 0; o <= 1; o++) {
    for (i = 2; i <= n; i++) {
      if (!vis[o][i])
        cout << "Loop ";
      else if (win[o][i])
        cout << "Win ";
      else
        cout << "Lose ";
      if (i == n) puts("");
    }
  }
  return 0;
}
