#include <bits/stdc++.h>
using namespace std;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
const long long maxn = 3e4;
const long long mod = 1e9 + 7;
const long double PI = acos((long double)-1);
long long pw(long long a, long long b, long long md = mod) {
  long long res = 1;
  while (b) {
    if (b & 1) {
      res = (a * res) % md;
    }
    a = (a * a) % md;
    b >>= 1;
  }
  return (res);
}
int st[maxn][2];
int n;
int k[2];
int cnt[maxn][2];
int a[maxn][2];
void state(int pos, int turn) {
  st[pos][1 - turn] = 0;
  for (int i = 0; i < k[turn]; i++) {
    int nxtt = (pos - a[i][turn] + n) % n;
    if (nxtt == 0) continue;
    if (st[nxtt][turn] == -1) {
      st[nxtt][turn] = 1;
      for (int j = 0; j < k[!turn]; j++) {
        int go = (nxtt - a[j][!turn] + n) % n;
        if (go == 0) continue;
        if (++cnt[go][1 - turn] == k[1 - turn]) state(go, turn);
      }
    }
  }
}
int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  cin >> n;
  cin >> k[0];
  for (int i = 0; i < k[0]; i++) cin >> a[i][0];
  cin >> k[1];
  for (int i = 0; i < k[1]; i++) cin >> a[i][1];
  memset(st, -1, sizeof st);
  ;
  state(0, 1);
  state(0, 0);
  for (int j = 0; j < 2; j++)
    for (int i = 1; i < n; i++) {
      int res = st[i][j];
      if (res == 1) cout << "Win" << ' ';
      if (res == 0) cout << "Lose" << ' ';
      if (res == -1) cout << "Loop" << ' ';
      if (i == n - 1 and j == 0) cout << '\n';
    }
  return (0);
}
