#include <bits/stdc++.h>
using namespace std;
struct Node {
  int p;
  bool ifwin;
  bool flag;
  Node(int _p = 0, bool _ifwin = 0, bool _flag = 0)
      : p(_p), ifwin(_ifwin), flag(_flag) {}
};
const int maxn = 1e4 + 10;
int a, b;
int astep[maxn], bstep[maxn];
int apd[maxn], bpd[maxn];
int acnt[maxn], bcnt[maxn];
int main() {
  int n, step;
  while (~scanf("%d", &n)) {
    memset(acnt, 0, sizeof(acnt));
    memset(bcnt, 0, sizeof(bcnt));
    memset(apd, -1, sizeof(apd));
    memset(bpd, -1, sizeof(bpd));
    scanf("%d", &a);
    for (int i = 0; i < a; i++) scanf("%d", &step), astep[i] = step;
    scanf("%d", &b);
    for (int i = 0; i < b; i++) scanf("%d", &step), bstep[i] = step;
    queue<Node> Q;
    apd[0] = bpd[0] = 0;
    Q.push(Node(0, 0, 1));
    Q.push(Node(0, 0, 0));
    while (!Q.empty()) {
      Node head = Q.front();
      Q.pop();
      if (head.flag) {
        for (int i = 0; i < b; i++) {
          int lst = ((head.p - bstep[i]) % n + n) % n;
          if (~bpd[lst]) continue;
          if (!head.ifwin) {
            bpd[lst] = 1;
            Q.push(Node(lst, 1, !head.flag));
            continue;
          } else
            bcnt[lst]++;
          if (bcnt[lst] == b) {
            bpd[lst] = 0;
            Q.push(Node(lst, 0, !head.flag));
          }
        }
      } else {
        for (int i = 0; i < a; i++) {
          int lst = ((head.p - astep[i]) % n + n) % n;
          if (~apd[lst]) continue;
          if (!head.ifwin) {
            apd[lst] = 1;
            Q.push(Node(lst, 1, !head.flag));
            continue;
          } else
            acnt[lst]++;
          if (acnt[lst] == a) {
            apd[lst] = 0;
            Q.push(Node(lst, 0, !head.flag));
          }
        }
      }
    }
    for (int i = 1; i < n; i++) {
      if (i > 1) printf(" ");
      if (apd[i] == 1)
        printf("Win");
      else if (apd[i] == 0)
        printf("Lose");
      else
        printf("Loop");
    }
    printf("\n");
    for (int i = 1; i < n; i++) {
      if (i > 1) printf(" ");
      if (bpd[i] == 1)
        printf("Win");
      else if (bpd[i] == 0)
        printf("Lose");
      else
        printf("Loop");
    }
    printf("\n");
  }
}
