#include <bits/stdc++.h>
using namespace std;
const int maxn = 7010;
int dp[maxn][2];
int vis[maxn][2];
int out_deg[maxn][2];
vector<int> a[2];
int n;
void f(int i, int j, int v) {
  if (vis[i][j]) return;
  vis[i][j] = 1;
  dp[i][j] = v;
  if (v == -1)
    for (int x : a[1 - j]) {
      int tmp = (i - x + n) % n;
      if (tmp == 0) continue;
      f(tmp, 1 - j, 1);
    }
  else
    for (int x : a[1 - j]) {
      int tmp = (i - x + n) % n;
      if (tmp == 0) continue;
      if (--out_deg[tmp][1 - j] == 0) f(tmp, 1 - j, -1);
    }
}
int main() {
  string ss[] = {"Lose", "Loop", "Win"};
  scanf("%d", &n);
  for (int j = 0; j < 2; j++) {
    int k, v;
    scanf("%d", &k);
    for (int i = 0; i < k; i++) {
      scanf("%d", &v);
      a[j].push_back(v);
    }
    for (int i = 1; i < n; i++) out_deg[i][j] = k;
  }
  f(0, 0, -1);
  f(0, 1, -1);
  for (int j = 0; j < 2; j++) {
    for (int i = 1; i < n; i++) cout << ss[dp[i][j] + 1] << " ";
    cout << endl;
  }
  return 0;
}
