#include <bits/stdc++.h>
using namespace std;
int dp[2][7005];
int n;
int a[2][7005];
int vis[2][7005];
int cnt[2][7005];
void dfs(int id, int now) {
  if (vis[id][now]) return;
  vis[id][now] = 1;
  int p = id ^ 1;
  for (int i = 1; i <= a[p][0]; i++) {
    int pre = (now - a[p][i] + n) % n;
    if (pre == 0) continue;
    if (dp[id][now] == 0) {
      dp[p][pre] = 1;
      dfs(p, pre);
    } else if (++cnt[p][pre] == a[p][0]) {
      dfs(p, pre);
    }
  }
}
int main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  cin >> n;
  cin >> a[0][0];
  for (int i = 1; i <= a[0][0]; i++) {
    cin >> a[0][i];
  }
  cin >> a[1][0];
  for (int i = 1; i <= a[1][0]; i++) cin >> a[1][i];
  dfs(1, 0);
  dfs(0, 0);
  for (int i = 1; i < n; i++) {
    if (vis[0][i] == 0)
      cout << "Loop ";
    else if (dp[0][i])
      cout << "Win ";
    else
      cout << "Lose ";
  }
  cout << endl;
  for (int i = 1; i < n; i++) {
    if (vis[1][i] == 0)
      cout << "Loop ";
    else if (dp[1][i])
      cout << "Win ";
    else
      cout << "Lose ";
  }
  return 0;
}
