#include <bits/stdc++.h>
using namespace std;
const int N = (7e+3 + 20) * 2;
int a[N];
int b[N];
int ans[N];
char *res[] = {"Loop", "Win", "Lose"};
vector<short> g[N];
int used[N];
int v[N];
int asize, bsize;
deque<pair<int, int>> q;
void init() {
  fill(ans, ans + N, 0);
  fill(v, v + N, 0);
  fill(used, used + N, 0);
  for (int i = 0; i < N; ++i) {
    g[i].clear();
  }
  q.clear();
}
void update(pair<int, int> x, int y) {
  if (used[y]) {
    return;
  }
  if (x.second == 2) {
    q.push_back({y, 1});
    used[y] = 1;
  } else {
    --v[y];
    if (v[y] == 0) {
      q.push_back({y, 2});
      used[y] = 1;
    }
  }
}
void solve(int n) {
  fill(v + 1, v + 1 + n, asize);
  fill(v + n + 1, v + 1 + 2 * n, bsize);
  q.push_back({1, 2});
  q.push_back({n + 1, 2});
  while (!q.empty()) {
    auto x = q.front();
    ans[x.first] = x.second;
    q.pop_front();
    if (x.first <= n) {
      for (int j = 1; j <= bsize; ++j) {
        update(x, (x.first - b[j] + n - 1) % n + 1 + n);
      }
    } else {
      for (int j = 1; j <= asize; ++j) {
        update(x, (x.first - a[j] + n - 1) % n + 1);
      }
    }
  }
}
int main() {
  int n;
  scanf("%d", &n);
  scanf("%d", &asize);
  for (int i = 1; i <= asize; ++i) {
    scanf("%d", &a[i]);
  }
  scanf("%d", &bsize);
  for (int i = 1; i <= bsize; ++i) {
    scanf("%d", &b[i]);
  }
  for (int t = 0; t < 2; ++t) {
    init();
    solve(n);
    for (int i = 2; i <= n; ++i) {
      printf("%s ", res[ans[i]]);
    }
    printf("\n");
    for (int i = 1; i <= max(asize, bsize); ++i) {
      swap(a[i], b[i]);
    }
    swap(asize, bsize);
  }
  return 0;
}
