#include <bits/stdc++.h>
using namespace std;
int k[2], s[2][7005];
int dp[2][7005];
int tot[2][7005];
int n;
int main() {
  memset(dp, -1, sizeof(dp));
  scanf("%d", &n);
  for (int i = 0; i < 2; i++) {
    scanf("%d", &k[i]);
    for (int j = 0; j < k[i]; j++) scanf("%d", &s[i][j]);
  }
  dp[0][0] = 1;
  dp[1][0] = 1;
  queue<pair<int, int> > q;
  q.push(pair<int, int>(0, 0));
  q.push(pair<int, int>(1, 0));
  while (!q.empty()) {
    int cur = q.front().first;
    int idx = q.front().second;
    q.pop();
    for (int i = 0; i < k[1 - cur]; i++) {
      int nt = (idx - s[1 - cur][i] + n) % n;
      if (dp[1 - cur][nt] == -1) {
        dp[1 - cur][nt] = 0;
        for (int j = 0; j < k[cur]; j++) {
          int nt2 = (nt - s[cur][j] + n) % n;
          if (dp[cur][nt2] == -1) {
            tot[cur][nt2]++;
            if (tot[cur][nt2] == k[cur]) {
              q.push(pair<int, int>(cur, nt2));
              dp[cur][nt2] = 1;
            }
          }
        }
      }
    }
  }
  for (int i = 0; i < 2; i++) {
    for (int j = 1; j < n; j++) {
      if (dp[i][j] == 0)
        printf("Win ");
      else if (dp[i][j] == 1)
        printf("Lose ");
      else
        printf("Loop ");
    }
    printf("\n");
  }
}
