#include <bits/stdc++.h>
using namespace std;
int n, k[2];
int m[7002][2];
int x[7002][2];
int second[2][7002];
queue<pair<int, int> > q;
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cin >> n;
  cin >> k[1];
  for (int i = 0; i < k[1]; i++) cin >> second[1][i];
  cin >> k[0];
  for (int i = 0; i < k[0]; i++) cin >> second[0][i];
  for (int i = 1; i < n; i++) x[i][0] = k[1];
  for (int i = 1; i < n; i++) x[i][1] = k[0];
  q.push({0, 0});
  q.push({0, 1});
  m[0][0] = 2;
  m[0][1] = 2;
  while (!q.empty()) {
    pair<int, int> i = q.front();
    q.pop();
    for (int j = 0; j < k[i.second]; j++) {
      if (m[i.first][i.second] == 1 &&
          m[(n + i.first - second[i.second][j]) % n][(i.second + 1) % 2] == 0) {
        x[(n + i.first - second[i.second][j]) % n][(i.second + 1) % 2]--;
        if (x[(n + i.first - second[i.second][j]) % n][(i.second + 1) % 2] <=
            0) {
          q.push({(n + i.first - second[i.second][j]) % n, (i.second + 1) % 2});
          m[(n + i.first - second[i.second][j]) % n][(i.second + 1) % 2] = 2;
        }
      } else if (m[i.first][i.second] == 2 &&
                 m[(n + i.first - second[i.second][j]) % n]
                  [(i.second + 1) % 2] == 0) {
        q.push({(n + i.first - second[i.second][j]) % n, (i.second + 1) % 2});
        m[(n + i.first - second[i.second][j]) % n][(i.second + 1) % 2] = 1;
      }
    }
  }
  for (int j = 0; j < 2; j++) {
    for (int i = 1; i < n; i++) {
      if (m[i][j] == 1)
        cout << "Win ";
      else if (m[i][j] == 2)
        cout << "Lose ";
      else
        cout << "Loop ";
    }
    cout << endl;
  }
  return 0;
}
