#include <bits/stdc++.h>
using namespace std;
const int INF = 1e9;
long long N;
int dp[2][7010];
int vis[2][7010];
int L[2];
int S[2][7010];
void pre() {
  queue<int> que;
  dp[0][0] = -1;
  que.push(0 * 101010 + 0);
  dp[1][0] = -1;
  que.push(1 * 101010 + 0);
  while (!que.empty()) {
    int q = que.front();
    que.pop();
    int p = q / 101010;
    int x = q % 101010;
    int pp = 1 - p;
    for (long long(i) = (0); (i) < (L[pp]); (i)++) {
      int xx = (x - S[pp][i] + N) % N;
      if (dp[p][x] < 0) {
        if (dp[pp][xx] == 0) {
          dp[pp][xx] = 1;
          que.push(pp * 101010 + xx);
        }
      } else {
        if (dp[p][x] == 0) continue;
        vis[pp][xx]++;
        if (vis[pp][xx] == L[pp]) {
          dp[pp][xx] = -1;
          que.push(pp * 101010 + xx);
        }
      }
    }
  }
}
int main() {
  cin.tie(0);
  ios_base::sync_with_stdio(false);
  cin >> N;
  for (long long(i) = (0); (i) < (2); (i)++) {
    cin >> L[i];
    for (long long(j) = (0); (j) < (L[i]); (j)++) cin >> S[i][j];
  }
  pre();
  for (long long(p) = (0); (p) < (2); (p)++) {
    for (long long(x) = (1); (x) < (N); (x)++) {
      int d = dp[p][x];
      if (d < 0)
        printf("Lose");
      else if (d == 0)
        printf("Loop");
      else
        printf("Win");
      if (x != N - 1) printf(" ");
    }
    printf("\n");
  }
  return 0;
}
