#include <bits/stdc++.h>
using namespace std;
int n, k[2], s[2][7005], f[7005][2], ok[7005][2];
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cin >> n;
  for (int i = 0; i < 2; i++) {
    cin >> k[i];
    for (int j = 1; j <= k[i]; j++) cin >> s[i][j];
  }
  memset(f, -1, sizeof(f));
  queue<pair<int, int> > qu;
  f[1][0] = 0;
  f[1][1] = 0;
  qu.push(pair<int, int>(1, 0));
  qu.push(pair<int, int>(1, 1));
  while (!qu.empty()) {
    int u = qu.front().first;
    int du = qu.front().second;
    qu.pop();
    for (int i = 1; i <= k[1 - du]; i++) {
      int v = (u + n - s[1 - du][i]) % n;
      if (v == 0) v = n;
      if (f[v][1 - du] != -1) continue;
      if (f[u][du] == 0) {
        f[v][1 - du] = 1;
        qu.push(pair<int, int>(v, 1 - du));
      } else {
        ok[v][1 - du]++;
        if (ok[v][1 - du] == k[1 - du]) {
          f[v][1 - du] = 0;
          qu.push(pair<int, int>(v, 1 - du));
        }
      }
    }
  }
  for (int i = 1; i < n; i++) {
    if (f[i + 1][0] == -1)
      cout << "Loop ";
    else if (f[i + 1][0] == 0)
      cout << "Lose ";
    else
      cout << "Win ";
  }
  cout << '\n';
  for (int i = 1; i < n; i++) {
    if (f[i + 1][1] == -1)
      cout << "Loop ";
    else if (f[i + 1][1] == 0)
      cout << "Lose ";
    else
      cout << "Win ";
  }
  return 0;
}
