#include <bits/stdc++.h>
using namespace std;
const int N = 2e4 + 50;
vector<int> g[N];
bool win[N];
bool los[N];
bool mark[N];
int deg[N];
int a[N], b[N];
int n, k1, k2;
void dfs(int v) {
  mark[v] = true;
  if (v < n)
    for (int i = 0; i < k2; i++) {
      int to = (v - b[i] + n) % n + n;
      if (!mark[to]) {
        if (win[to] || los[to]) continue;
        if (los[v])
          win[to] = true;
        else {
          --deg[to];
          if (deg[to] == 0)
            los[to] = true;
          else
            continue;
        }
        dfs(to);
      }
    }
  else
    for (int i = 0; i < k1; i++) {
      int to = (v - a[i] + n) % n;
      if (!mark[to]) {
        if (win[to] || los[to]) continue;
        if (los[v])
          win[to] = true;
        else {
          --deg[to];
          if (deg[to] == 0)
            los[to] = true;
          else
            continue;
        }
        dfs(to);
      }
    }
}
int main() {
  ios::sync_with_stdio(0);
  cin >> n;
  cin >> k1;
  for (int i = 0; i < k1; i++) cin >> a[i];
  cin >> k2;
  for (int i = 0; i < k2; i++) cin >> b[i];
  for (int i = 0; i < n; i++) {
    deg[i] = k1;
    deg[n + i] = k2;
  }
  los[0] = true;
  los[n] = true;
  mark[0] = true;
  mark[n] = true;
  dfs(0);
  dfs(n);
  for (int i = 1; i < n; i++) {
    if (!los[i] && !win[i]) cout << "Loop ";
    if (los[i]) cout << "Lose ";
    if (win[i]) cout << "Win ";
  }
  cout << endl;
  for (int i = n + 1; i < 2 * n; i++) {
    if (!los[i] && !win[i]) cout << "Loop ";
    if (los[i]) cout << "Lose ";
    if (win[i]) cout << "Win ";
  }
  return 0;
}
