#include <bits/stdc++.h>
using namespace std;
long long n, k[2], s[2][7005] = {0};
long long cnt[2][7005] = {0}, win[2][7005] = {0}, vis[2][7005] = {0};
void dfs(long long v, long long pos) {
  if (vis[v][pos]) return;
  vis[v][pos] = 1;
  long long u = !v;
  for (long long i = 1; i <= k[u]; i++) {
    long long pre = pos - s[u][i];
    if (pre <= 0) pre = pre + n;
    if (pre == 1) continue;
    if (!win[v][pos]) {
      win[u][pre] = 1;
      dfs(u, pre);
    } else {
      ++cnt[u][pre];
      if (cnt[u][pre] == k[u]) {
        win[u][pre] = 0;
        dfs(u, pre);
      }
    }
  }
}
int main() {
  cin >> n;
  for (long long i = 0; i <= 1; i++) {
    cin >> k[i];
    for (long long j = 1; j <= k[i]; j++) cin >> s[i][j];
  }
  win[0][1] = 0;
  win[1][1] = 0;
  dfs(0, 1);
  dfs(1, 1);
  for (long long i = 0; i <= 1; i++) {
    for (long long j = 2; j <= n; j++) {
      cout << (vis[i][j] ? (win[i][j] ? "Win" : "Lose") : "Loop")
           << (j == n ? '\n' : ' ');
    }
  }
  return 0;
}
