#include <bits/stdc++.h>
using namespace std;
int n, k[2], x[2][100005], dp[100005][2];
void go(int a, int b) {
  int bb = 1 - b;
  if (dp[a][b] == b) {
    for (int c = (0); c < (k[bb]); c++) {
      int ta = a + x[bb][c];
      if (ta >= n) ta -= n;
      if (dp[ta][bb] < 0) {
        if (dp[ta][bb]-- == -k[bb]) {
          dp[ta][bb] = b;
          go(ta, bb);
        }
      }
    }
  } else {
    for (int c = (0); c < (k[bb]); c++) {
      int ta = a + x[bb][c];
      if (ta >= n) ta -= n;
      if (dp[ta][bb] < 0) {
        dp[ta][bb] = bb;
        go(ta, bb);
      }
    }
  }
}
int main() {
  scanf("%d", &n);
  for (int a = (0); a < (2); a++) {
    scanf("%d", k + a);
    for (int b = (0); b < (k[a]); b++) {
      scanf("%d", &x[a][b]);
      x[a][b] = n - x[a][b];
    }
  }
  memset(dp, -1, sizeof(dp));
  for (int a = (0); a < (2); a++) dp[0][a] = 1 - a;
  for (int a = (0); a < (2); a++) go(0, a);
  for (int a = (0); a < (2); a++)
    for (int b = (1); b < (n); b++) {
      if (dp[b][a] == a)
        printf("Win");
      else if (dp[b][a] >= 0)
        printf("Lose");
      else
        printf("Loop");
      if (b + 1 == n)
        printf("\n");
      else
        printf(" ");
    }
  return 0;
}
