#include <bits/stdc++.h>
using namespace std;
const int maxn = 1e4;
int f[2][maxn], ct[2], n, vis[2][maxn], dp[2][maxn], s[2][maxn];
void dfs(int x, int y) {
  for (int i = 1; i <= ct[x ^ 1]; i++) {
    int z = (y - s[x ^ 1][i] + n) > n ? y - s[x ^ 1][i] : y - s[x ^ 1][i] + n;
    if (dp[x][y] == 1) {
      if (!vis[x ^ 1][z]) {
        dp[x ^ 1][z] = 2;
        vis[x ^ 1][z] = 1;
        dfs(x ^ 1, z);
      }
    } else if (dp[x][y] == 2) {
      f[x ^ 1][z]--;
      if (f[x ^ 1][z] == 0) {
        if (!vis[x ^ 1][z]) {
          dp[x ^ 1][z] = 1;
          vis[x ^ 1][z] = 1;
          dfs(x ^ 1, z);
        }
      }
    }
  }
}
int main() {
  cin >> n;
  cin >> ct[0];
  for (int i = 1; i <= ct[0]; i++) cin >> s[0][i];
  cin >> ct[1];
  for (int i = 1; i <= ct[1]; i++) cin >> s[1][i];
  for (int t = 0; t <= 1; t++)
    for (int i = 2; i <= n; i++) f[t][i] = ct[t];
  dp[0][1] = 1;
  dp[1][1] = 1;
  vis[0][1] = 1;
  vis[1][1] = 1;
  dfs(0, 1);
  dfs(1, 1);
  for (int t = 0; t <= 1; t++) {
    for (int i = 2; i <= n; i++) {
      if (dp[t][i] == 1)
        cout << "Lose ";
      else if (dp[t][i] == 2)
        cout << "Win ";
      else
        cout << "Loop ";
    }
    printf("\n");
  }
  return 0;
}
