#include <bits/stdc++.h>
using namespace std;
const int N = 10005;
pair<int, int> q[N * 2];
int f[2][N];
int step[2][N], dem[2][N];
int sz[2];
int main() {
  int n;
  scanf("%d", &n);
  for (int i = 0; i < 2; i++) {
    scanf("%d", sz + i);
    for (int j = 0; j < sz[i]; j++) scanf("%d", step[i] + j);
  }
  int len = -1;
  f[1][0] = 2;
  f[0][0] = 2;
  q[++len] = {1, 0};
  q[++len] = {0, 0};
  int head = 0;
  while (head <= len) {
    int u = q[head].first;
    int v = q[head].second;
    head++;
    int tmp = f[u][v];
    u ^= 1;
    for (int i = 0; i < sz[u]; i++) {
      int z = v - step[u][i];
      if (z < 0) z += n;
      if (tmp == 2) {
        if (f[u][z] == 0) {
          f[u][z] = 1;
          q[++len] = {u, z};
        }
      } else if (f[u][z] == 0) {
        dem[u][z]++;
        if (dem[u][z] == sz[u]) {
          f[u][z] = 2;
          q[++len] = {u, z};
        }
      }
    }
  }
  for (int i = 0; i < 2; i++) {
    for (int j = 1; j < n; j++) {
      if (f[i][j] == 0)
        printf("Loop ");
      else if (f[i][j] == 1)
        printf("Win ");
      else
        printf("Lose ");
    }
    printf("\n");
  }
}
