#include <bits/stdc++.h>
using namespace std;
int a[7001][2], cnt[7001][2], p[2], n, b[7001][2], r, o;
queue<pair<int, int> > h;
bool f[7001][2];
int main() {
  scanf("%d", &n);
  scanf("%d", &p[0]);
  for (int i = 0; i < p[0]; i++) scanf("%d", &b[i][0]);
  scanf("%d", &p[1]);
  for (int i = 0; i < p[1]; i++) scanf("%d", &b[i][1]);
  for (int i = 1; i < n; i++) cnt[i][0] = p[0], cnt[i][1] = p[1];
  a[0][0] = 1;
  a[0][1] = 1;
  h.push({0, 0});
  h.push({0, 1});
  while (!h.empty()) {
    pair<int, int> tmp = h.front();
    h.pop();
    r = tmp.second ^ 1;
    f[tmp.first][tmp.second] = true;
    for (int j = 0; j < p[r]; j++) {
      o = (tmp.first - b[j][r] + n) % n;
      if (a[tmp.first][tmp.second] == 1) {
        if (!f[o][r]) a[o][r] = -1, h.push({o, r});
      } else {
        cnt[o][r]--;
        if (!cnt[o][r] && !f[o][r]) a[o][r] = 1, h.push({o, r});
      }
    }
  }
  for (int i = 1; i < n; i++)
    if (a[i][0] == 1)
      printf("Lose ");
    else if (a[i][0] == 0)
      printf("Loop ");
    else
      printf("Win ");
  printf("\n");
  for (int i = 1; i < n; i++)
    if (a[i][1] == 1)
      printf("Lose ");
    else if (a[i][1] == 0)
      printf("Loop ");
    else
      printf("Win ");
  printf("\n");
}
