#include <bits/stdc++.h>
using namespace std;
const int N = 7000;
struct node {
  int p;
  bool d;
};
int d[N + 1][2], k[2], s[2][N + 1], f[N + 1][2];
int main() {
  int n;
  scanf("%d", &n);
  for (int i = 0; i <= 1; ++i) {
    scanf("%d", &k[i]);
    for (int j = 1; j <= k[i]; ++j) scanf("%d", &s[i][j]);
  }
  for (int i = 1; i <= n; ++i) d[i][0] = k[0], d[i][1] = k[1];
  queue<node> Q;
  f[1][0] = f[1][1] = 2;
  Q.push({1, 0});
  Q.push({1, 1});
  for (; !Q.empty(); Q.pop()) {
    node x = Q.front(), y;
    y.d = x.d ^ 1;
    for (int i = 1; i <= k[y.d]; ++i) {
      y.p = x.p - s[y.d][i];
      if (y.p < 1) y.p += n;
      if (f[y.p][y.d]) continue;
      if (f[x.p][x.d] == 2) {
        f[y.p][y.d] = 1;
        Q.push(y);
      } else {
        --d[y.p][y.d];
        if (!d[y.p][y.d]) {
          f[y.p][y.d] = 2;
          Q.push(y);
        }
      }
    }
  }
  for (int i = 0; i <= 1; ++i) {
    for (int j = 2; j <= n; ++j)
      if (f[j][i] == 0)
        printf("Loop ");
      else if (f[j][i] == 1)
        printf("Win ");
      else
        printf("Lose ");
    printf("\n");
  }
  return 0;
}
