#include <bits/stdc++.h>
using namespace std;
const int MAXN = 7e3 + 7;
const int INF = 1e9 + 7;
int n;
vector<int> s[2];
int num[MAXN][2];
int dp[MAXN][2];
void dfs(int x, int d, int state) {
  dp[x][d] = state;
  int ta, tb;
  for (int i = 0; i < s[1 - d].size(); i++) {
    ta = s[1 - d][i];
    tb = (x + ta) % n;
    if (~dp[tb][1 - d]) continue;
    if (state) {
      if (!--num[tb][1 - d]) dfs(tb, 1 - d, 0);
    } else
      dfs(tb, 1 - d, 1);
  }
}
int main() {
  int ta, tb;
  scanf("%d", &n);
  scanf("%d", &ta);
  memset(dp, -1, sizeof(dp));
  for (int i = 0; i < ta; i++) {
    scanf("%d", &tb);
    s[0].push_back(n - tb);
  }
  scanf("%d", &ta);
  for (int i = 0; i < ta; i++) {
    scanf("%d", &tb);
    s[1].push_back(n - tb);
  }
  for (int i = 1; i < n; i++) num[i][0] = s[0].size(), num[i][1] = s[1].size();
  dp[0][1] = dp[0][0] = 0;
  dfs(0, 0, 0);
  dfs(0, 1, 0);
  for (int k = 0; k < 2; k++) {
    for (int i = 1; i < n; i++)
      if (dp[i][k] == 1)
        printf("Win ");
      else if (!dp[i][k])
        printf("Lose ");
      else
        printf("Loop ");
    printf("\n");
  }
}
