#include <bits/stdc++.h>
using namespace std;
const int MOD = 1e9 + 7;
const int C = 26;
void add(int &x, int y) {
  x += y;
  while (x >= MOD) x -= MOD;
  while (x < 0) x += MOD;
}
int fix(int x) {
  while (x >= MOD) x -= MOD;
  while (x < 0) x += MOD;
  return x;
}
int pw(int a, int b) {
  int ret = 1;
  while (b) {
    if (b & 1) ret = 1ll * ret * a % MOD;
    b >>= 1;
    a = 1ll * a * a % MOD;
  }
  return ret;
}
const int MAXN = 7000 + 10;
const int WIN = 1, LOSE = 2;
string out[] = {"Loop", "Win", "Lose"};
int n, m[2], a[2][MAXN], win[2][MAXN], dp[2][MAXN];
pair<int, int> qu[MAXN << 1];
int sz;
void solve() {
  cin >> n;
  for (int i = 0; i < 2; i++) {
    cin >> m[i];
    for (int j = 0; j < m[i]; j++) {
      cin >> a[i][j];
    }
  }
  dp[0][0] = dp[1][0] = LOSE;
  qu[sz++] = {0, 0};
  qu[sz++] = {1, 0};
  for (int i = 0; i < sz; i++) {
    auto [t, x] = qu[i];
    if (dp[t][x] == LOSE) {
      for (int j = 0; j < m[t ^ 1]; j++) {
        int nx = (x - a[t ^ 1][j] + n) % n;
        if (dp[t ^ 1][nx] != WIN) {
          dp[t ^ 1][nx] = WIN;
          qu[sz++] = {t ^ 1, nx};
        }
      }
    } else {
      for (int j = 0; j < m[t ^ 1]; j++) {
        int nx = (x - a[t ^ 1][j] + n) % n;
        if (dp[t ^ 1][nx]) continue;
        if (++win[t ^ 1][nx] == m[t ^ 1]) {
          dp[t ^ 1][nx] = LOSE;
          qu[sz++] = {t ^ 1, nx};
        }
      }
    }
  }
  for (int i = 0; i < 2; i++) {
    for (int j = 1; j < n; j++) {
      cout << out[dp[i][j]] << " ";
    }
    cout << "\n";
  }
}
int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  int te = 1;
  for (int w = 1; w <= te; w++) {
    solve();
  }
  return 0;
}
