#include <bits/stdc++.h>
using namespace std;
const int MAXN = 7777;
int d[MAXN][2], a[MAXN][2], c[MAXN][2];
bool u[MAXN][2];
int n, k[2];
int main() {
  cin >> n;
  for (int t = 0; t < 2; t++) {
    cin >> k[t];
    for (int i = 0; i < k[t]; i++) {
      cin >> a[i][t];
    }
  }
  queue<pair<int, int> > q;
  d[0][0] = 1;
  d[0][1] = 1;
  q.push({0, 0});
  q.push({0, 1});
  while (!q.empty()) {
    int p = q.front().second, s = q.front().first;
    int np = (p + 1) % 2;
    q.pop();
    for (int i = 0; i < k[np]; i++) {
      int to = (n + s - a[i][np]) % n;
      if (d[s][p] == 1) {
        if (d[to][np] == 0) {
          d[to][np] = 2;
          q.push({to, np});
        }
      } else {
        c[to][np]++;
        if (c[to][np] == k[np]) {
          d[to][np] = 1;
          q.push({to, np});
        }
      }
    }
  }
  for (int t = 0; t < 2; t++) {
    for (int i = 1; i < n; i++) {
      if (d[i][t] == 1) {
        cout << "Lose";
      } else {
        if (d[i][t] == 2) {
          cout << "Win";
        } else {
          cout << "Loop";
        }
      }
      cout << " ";
    }
    cout << endl;
  }
  return 0;
}
