#include <bits/stdc++.h>
using namespace std;
const int N = 7010;
int n, a[3][N], dp[N][3], cntW[N][3];
void solve(int cur, int p) {
  int op = 3 - p;
  for (int i = 1; i <= a[op][0]; i++) {
    int nxt = (cur - a[op][i] + n) % n;
    if (nxt == 0) nxt = n;
    if (dp[nxt][op] != -1) continue;
    if (dp[cur][p] == 0) {
      dp[nxt][op] = 1;
      solve(nxt, op);
    } else {
      cntW[nxt][op]--;
      if (cntW[nxt][op] == 0) {
        dp[nxt][op] = 0;
        solve(nxt, op);
      }
    }
  }
}
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cin >> n;
  for (int i = 1; i <= 2; i++) {
    cin >> a[i][0];
    for (int j = 1; j <= a[i][0]; j++) cin >> a[i][j];
  }
  for (int i = 1; i <= 2; i++)
    for (int j = 1; j <= n; j++) cntW[j][i] = a[i][0];
  memset(dp, -1, sizeof dp);
  dp[1][1] = 0, dp[1][2] = 0;
  solve(1, 1);
  solve(1, 2);
  for (int i = 1; i <= 2; i++) {
    for (int j = 2; j <= n; j++)
      if (dp[j][i] == 1)
        cout << "Win"
             << " ";
      else if (dp[j][i] == 0)
        cout << "Lose"
             << " ";
      else
        cout << "Loop"
             << " ";
    cout << "\n";
  }
  return 0;
}
