#include <bits/stdc++.h>
using namespace std;
queue<pair<int, int>> q;
int n, s[2][7002], k[2], deg[2][7000];
;
inline void out(int f) {
  if (f == 1) printf("Win ");
  if (f == -1) printf("Loop ");
  if (f == 0) printf("Lose ");
}
int vis[7002][2];
void bfs() {
  while (!q.empty()) {
    int x = q.front().first;
    bool turn = q.front().second;
    q.pop();
    for (int i = 0; i < k[1 ^ turn]; i++) {
      int nxt = x - s[1 ^ turn][i];
      if (nxt < 1) nxt += n;
      if (vis[nxt][1 ^ turn] != -1) continue;
      if (vis[x][turn] == 0) {
        vis[nxt][1 ^ turn] = 1;
        q.push({nxt, 1 ^ turn});
        continue;
      }
      deg[turn][nxt]++;
      if (deg[turn][nxt] == k[turn ^ 1]) {
        vis[nxt][turn ^ 1] = 0;
        q.push({nxt, turn ^ 1});
      }
    }
  }
}
int main() {
  cin >> n;
  cin >> k[0];
  for (int i = 0; i < k[0]; i++) scanf("%d", &s[0][i]);
  cin >> k[1];
  for (int i = 0; i < k[1]; i++) scanf("%d", &s[1][i]);
  memset(vis, -1, sizeof vis);
  vis[1][0] = vis[1][1] = 0;
  q.push({1, 0});
  q.push({1, 1});
  bfs();
  for (int i = 2; i <= n; i++) {
    out(vis[i][0]);
  }
  printf("\n");
  for (int i = 2; i <= n; i++) {
    out(vis[i][1]);
  }
  return 0;
}
