#include <bits/stdc++.h>
using namespace std;
const int N = 8000;
const int M = 1e9 + 7;
const double eps = 1e-6;
const double PI(acos(-1.0));
int n, a[N][2];
int f[N][2], vis[N][2], c[N][2];
int k[2];
void dfs(int pos, int t) {
  vis[pos][t] = 1;
  for (int j = 0; j < (k[!t]); j++) {
    int pre = (pos - a[j][!t] + n) % n;
    if (!pre) continue;
    if (vis[pre][!t]) continue;
    if (f[pos][t] == 0) {
      f[pre][!t] = 1;
      dfs(pre, !t);
    } else if (f[pos][t] == 1 && ++c[pre][!t] == k[!t]) {
      f[pre][!t] = 0;
      dfs(pre, !t);
    }
  }
}
int main() {
  cin >> n;
  cin >> k[0];
  for (int i = 0; i < (k[0]); i++) cin >> a[i][0];
  cin >> k[1];
  for (int i = 0; i < (k[1]); i++) cin >> a[i][1];
  memset(f, -1, sizeof f);
  f[0][0] = f[0][1] = 0;
  dfs(0, 0);
  dfs(0, 1);
  for (int i = 0; i < (2); i++) {
    for (int j = (1); j <= (n - 1); j++) {
      if (~f[j][i]) {
        if (f[j][i])
          cout << "Win ";
        else
          cout << "Lose ";
      } else
        cout << "Loop ";
    }
    cout << endl;
  }
}
