#include <bits/stdc++.h>
using namespace std;
int n, memo[2][8000], k[2], wins[2][8000];
vector<int> v[2];
string vs[] = {"Loop", "Lose", "Win"};
int main() {
  cin >> n;
  for (int i = 0; i < 2; i++) {
    cin >> k[i];
    for (int j = 0; j < k[i]; j++) {
      int num;
      cin >> num;
      v[i].push_back(num);
    }
  }
  memo[0][1] = memo[1][1] = 1;
  queue<pair<int, int> > q;
  q.push(pair<int, int>(0, 1));
  q.push(pair<int, int>(1, 1));
  while (not q.empty()) {
    auto aux = q.front();
    q.pop();
    int t = get<0>(aux), p = get<1>(aux);
    for (int i = 0; i < k[t ^ 1]; i++) {
      int prev = (p - v[t ^ 1][i] + n) % n;
      if (prev == 0) prev = n;
      if (not memo[t ^ 1][prev]) {
        if (memo[t][p] == 1) {
          memo[t ^ 1][prev] = 2;
          q.push(pair<int, int>(t ^ 1, prev));
        } else {
          wins[t ^ 1][prev]++;
          if (wins[t ^ 1][prev] == k[t ^ 1]) {
            memo[t ^ 1][prev] = 1;
            q.push(pair<int, int>(t ^ 1, prev));
          }
        }
      }
    }
  }
  for (int i = 0; i < 2; i++) {
    cout << vs[memo[i][2]];
    for (int j = 3; j <= n; j++) cout << " " << vs[memo[i][j]];
    cout << endl;
  }
  return 0;
}
