#include <bits/stdc++.h>
using namespace std;
const int N = 7e3 + 5;
int n, k[3];
int s[3][N], f[3][N];
char ans[3][10] = {"Win", "Lose", "Loop"};
int main() {
  scanf("%d", &n);
  for (int i = 1; i <= 2; i++) {
    scanf("%d", &k[i]);
    for (int j = 1; j <= k[i]; j++) scanf("%d", &s[i][j]);
  }
  queue<pair<int, int> > q;
  q.push(make_pair(1, 1));
  q.push(make_pair(2, 1));
  f[1][1] = f[2][1] = -1;
  while (!q.empty()) {
    auto tmp = q.front();
    q.pop();
    int now = tmp.first, x = tmp.second;
    int next = 3 - now;
    if (f[now][x] == -1) {
      for (int i = 1; i <= k[next]; i++) {
        int y = x - s[next][i];
        if (y <= 0) y += n;
        if (f[next][y] != -2) {
          f[next][y] = -2;
          q.push(make_pair(next, y));
        }
      }
    } else {
      for (int i = 1; i <= k[next]; i++) {
        int y = x - s[next][i];
        if (y <= 0) y += n;
        if (f[next][y] < 0) continue;
        f[next][y]++;
        if (f[next][y] == k[next]) {
          f[next][y] = -1;
          q.push(make_pair(next, y));
        }
      }
    }
  }
  for (int i = 1; i <= 2; i++) {
    for (int j = 2; j <= n; j++) {
      if (f[i][j] == -2)
        printf("Win");
      else if (f[i][j] == -1)
        printf("Lose");
      else
        printf("Loop");
      printf("%c", " \n"[j == n]);
    }
  }
  return 0;
}
