#include <bits/stdc++.h>
using namespace std;
int n, n1, n2;
int a[10005], b[10005], f1[10005], f2[10005], g1[10005], g2[10005];
bool t1[10005], t2[10005];
int dq;
int main() {
  scanf("%d", &n);
  scanf("%d", &n1);
  for (int i = 1; i <= n1; ++i) scanf("%d", &a[i]);
  scanf("%d", &n2);
  for (int i = 1; i <= n2; ++i) scanf("%d", &b[i]);
  for (int i = 1; i <= n; ++i) f1[i] = f2[i] = -1;
  f1[1] = f2[1] = 0;
  for (int i = 1; i <= n; ++i) g1[i] = g2[i] = 0;
  for (int i = 1; i <= n; ++i) t1[i] = t2[i] = false;
  for (int i = 1; i <= n1; ++i) t1[n + 1 - a[i]] = true;
  for (int i = 1; i <= n2; ++i) t2[n + 1 - b[i]] = true;
  while (true) {
    bool flag = false;
    for (int i = 1; i <= n; ++i) {
      if (f1[i] != -1) continue;
      if (t1[i]) {
        f1[i] = 1;
        flag = true;
        for (int j = 1; j <= n2; ++j) {
          dq = i - b[j] + n;
          dq = (dq - 1) % n + 1;
          g2[dq]++;
        }
      }
      if (g1[i] == n1) {
        f1[i] = 0;
        flag = true;
        for (int j = 1; j <= n2; ++j) {
          dq = i - b[j] + n;
          dq = (dq - 1) % n + 1;
          t2[dq] = true;
        }
      }
    }
    for (int i = 1; i <= n; ++i) {
      if (f2[i] != -1) continue;
      if (t2[i]) {
        f2[i] = 1;
        flag = true;
        for (int j = 1; j <= n1; ++j) {
          dq = i - a[j] + n;
          dq = (dq - 1) % n + 1;
          g1[dq]++;
        }
      }
      if (g2[i] == n2) {
        f2[i] = 0;
        flag = true;
        for (int j = 1; j <= n1; ++j) {
          dq = i - a[j] + n;
          dq = (dq - 1) % n + 1;
          t1[dq] = true;
        }
      }
    }
    if (!flag) break;
  }
  for (int i = 2; i <= n; ++i) {
    if (f1[i] == 0)
      printf("Lose ");
    else if (f1[i] == 1)
      printf("Win ");
    else
      printf("Loop ");
  }
  printf("\n");
  for (int i = 2; i <= n; ++i) {
    if (f2[i] == 0)
      printf("Lose ");
    else if (f2[i] == 1)
      printf("Win ");
    else
      printf("Loop ");
  }
  return 0;
}
