#include <bits/stdc++.h>
using namespace std;
int n, f[7010][3], g[7010][3];
vector<int> v[3];
string s(int x) {
  if (x == 1) return "Win";
  if (x == 2) return "Lose";
  return "Loop";
}
int cal(int x) {
  if (x > n) x -= n;
  if (x < 1) x += n;
  return x;
}
void solve() {
  f[1][1] = 2;
  f[1][2] = 2;
  for (int i = 2; i <= n; i++)
    for (int j = 1; j <= 2; j++) g[i][j] = ((int)v[j].size());
  queue<pair<int, int> > q;
  q.push(make_pair(1, 1));
  q.push(make_pair(1, 2));
  while (!q.empty()) {
    pair<int, int> Temp = q.front();
    q.pop();
    int u = Temp.first, x = Temp.second, y = 3 - x;
    if (f[u][x] == 2) {
      for (int l : v[y]) {
        int temp = cal(u - l);
        if (f[temp][y] == 0) {
          f[temp][y] = 1;
          q.push(make_pair(temp, y));
        }
      }
    } else {
      for (int l : v[y]) {
        int temp = cal(u - l);
        g[temp][y]--;
        if (g[temp][y] == 0) {
          f[temp][y] = 2;
          q.push(make_pair(temp, y));
        }
      }
    }
  }
  for (int j = 1; j <= 2; j++) {
    for (int i = 2; i <= n; i++) cout << s(f[i][j]) << ' ';
    cout << '\n';
  }
}
int main() {
  if (fopen("a.txt", "r")) {
    freopen("a.txt", "r", stdin);
  } else
    ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cin >> n;
  for (int i = 1; i <= 2; i++) {
    int x, u;
    cin >> x;
    for (int j = 1; j <= x; j++) {
      cin >> u;
      v[i].push_back(u);
    }
  }
  solve();
}
