#include <bits/stdc++.h>
using namespace std;
const int maxn = 7e3 + 3;
const int maxm = 1e6 + 3;
const int mod = 1e9 + 7;
const int oo = 1e9 + 5;
const long double pi = 3.141592653589793238462643383279502884;
void input() {
  if (fopen("abc"
            ".inp",
            "r")) {
    freopen(
        "abc"
        ".inp",
        "r", stdin);
    freopen(
        "abc"
        ".out",
        "w", stdout);
  }
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
}
int n, loop;
int vis[maxn * 2], k[2], d[maxn * 2], cnt[maxn * 2];
vector<int> g[2];
queue<pair<int, int> > q;
void Qpush(int v, int flag) {
  vis[v] = 1;
  q.push({v, flag});
}
void solve() {
  memset(d, -1, sizeof(d));
  d[n] = d[0] = 0;
  Qpush(n, 0);
  Qpush(0, 1);
  while (!q.empty()) {
    int u = q.front().first, flag = q.front().second;
    q.pop();
    for (int w : g[flag]) {
      int v = (u - w + n) % n + n * flag;
      if (vis[v]) continue;
      if (d[u] == 0) {
        d[v] = 1;
        Qpush(v, flag ^ 1);
      } else {
        cnt[v]++;
        if (cnt[v] == k[flag]) {
          d[v] = 0;
          Qpush(v, flag ^ 1);
        }
      }
    }
  }
  for (int flag = 0; flag < 2; ++flag) {
    for (int i = 1; i < n; ++i) {
      if (d[i + flag * n] == 1)
        cout << "Win ";
      else if (d[i + flag * n] == 0)
        cout << "Lose ";
      else
        cout << "Loop ";
    }
    cout << "\n";
  }
}
int main() {
  input();
  cin >> n;
  for (int it = 0; it < 2; ++it) {
    cin >> k[it];
    g[it].resize(k[it]);
    for (int i = 0; i < k[it]; ++i) cin >> g[it][i];
  }
  solve();
  return 0;
}
