#include <bits/stdc++.h>
using namespace std;
const long long MOD = 1e9 + 7;
const long long N = 7e3 + 5;
const long double pi = 3.14159265359;
const long long INF = (1LL << 63);
long long n, s[2], a[2][N], vis[2][N], d[2][N], x;
void DFS(long long ro, long long w) {
  long long t = 1 - ro;
  if (vis[ro][w] == 2) {
    for (long long j = 0; j < s[t]; j++) {
      x = (w - a[t][j] + n - 1) % n + 1;
      if (!vis[t][x]) {
        vis[t][x] = 1;
        DFS(t, x);
      }
    }
  } else {
    for (long long j = 0; j < s[t]; j++) {
      x = (w - a[t][j] + n - 1) % n + 1;
      d[t][x]--;
      if (d[t][x] == 0) {
        vis[t][x] = 2;
        DFS(t, x);
      }
    }
  }
}
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cin >> n;
  for (long long i = 0; i < 2; i++) {
    cin >> s[i];
    for (long long j = 0; j < s[i]; j++) cin >> a[i][j];
  }
  for (long long i = 0; i < 2; i++)
    for (long long j = 1; j <= n; j++) d[i][j] = s[i];
  vis[0][1] = 2;
  vis[1][1] = 2;
  DFS(0, 1);
  DFS(1, 1);
  for (long long i = 0; i < 2; i++) {
    for (long long j = 2; j <= n; j++) {
      cout << (vis[i][j] ? (vis[i][j] == 1 ? "Win " : "Lose ") : "Loop ");
    }
    cout << "\n";
  }
  return 0;
}
