#include <bits/stdc++.h>
using namespace std;
const int N = 2e5 + 500;
const long long mod = 1e9 + 7;
const long long INF = 1LL << 57;
long long int a[2][N];
long long int cnt[2][N];
long long int ans[2][N];
queue<pair<long long int, long long int> > q;
long long int k[2], n;
void bfs() {
  while (!q.empty()) {
    long long int t = q.front().first;
    long long int u = q.front().second;
    q.pop();
    if (ans[t][u] == -1) {
      for (int i = 0; i < k[1 - t]; i++) {
        long long int v = (u - a[1 - t][i] + n) % n;
        if (ans[1 - t][v] == 0) {
          ans[1 - t][v] = 1;
          q.push({1 - t, v});
        }
      }
    } else {
      for (int i = 0; i < k[1 - t]; i++) {
        long long int v = (u - a[1 - t][i] + n) % n;
        if (ans[1 - t][v] == 0 && --cnt[1 - t][v] == 0) {
          ans[1 - t][v] = -1;
          q.push({1 - t, v});
        }
      }
    }
  }
  return;
}
void solve() {
  cin >> n;
  cin >> k[0];
  for (int i = 0; i < k[0]; i++) cin >> a[0][i];
  cin >> k[1];
  for (int i = 0; i < k[1]; i++) cin >> a[1][i];
  for (int i = 0; i < n; i++) {
    cnt[0][i] = k[0];
    cnt[1][i] = k[1];
  }
  ans[0][0] = -1;
  ans[1][0] = -1;
  q.push({0, 0});
  q.push({1, 0});
  bfs();
  for (int i = 1; i < n; i++) {
    if (ans[0][i] == 1)
      cout << "Win";
    else if (ans[0][i] == -1)
      cout << "Lose";
    else
      cout << "Loop";
    cout << ' ';
  }
  cout << endl;
  for (int i = 1; i < n; i++) {
    if (ans[1][i] == 1)
      cout << "Win";
    else if (ans[1][i] == -1)
      cout << "Lose";
    else
      cout << "Loop";
    cout << ' ';
  }
  cout << endl;
  return;
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  long long int t;
  t = 1;
  while (t--) {
    solve();
  }
  return 0;
}
