#include <bits/stdc++.h>
using namespace std;
long long n, m, k, a[7777], b[7777], win[15555], lose[15555], w[15555],
    deg[15555];
void dfs(long long x) {
  w[x] = 1;
  vector<long long> v;
  if (x & 1) {
    long long ver = (x - 1) / 2;
    for (long long i = 1; i <= m; i++) v.push_back((ver - a[i] + n) % n * 2);
  } else {
    long long ver = x / 2;
    for (long long i = 1; i <= k; i++)
      v.push_back((ver - b[i] + n) % n * 2 + 1);
  }
  for (long long to : v) {
    if (w[to]) continue;
    if (lose[x])
      win[to] = 1;
    else if (--deg[to] == 0)
      lose[to] = 1;
    else
      continue;
    dfs(to);
  }
  v.clear();
}
int main() {
  cin >> n >> m;
  for (long long i = 1; i <= m; i++) cin >> a[i];
  cin >> k;
  for (long long i = 1; i <= k; i++) cin >> b[i];
  for (long long i = 1; i < n; i++) deg[i * 2] += m, deg[i * 2 + 1] += k;
  lose[0] = lose[1] = 1;
  dfs(0);
  dfs(1);
  for (long long i = 1; i < n; i++)
    if (win[i * 2])
      printf("Win ");
    else if (lose[i * 2])
      printf("Lose ");
    else
      printf("Loop ");
  cout << endl;
  for (long long i = 1; i < n; i++)
    if (win[i * 2 + 1])
      printf("Win ");
    else if (lose[i * 2 + 1])
      printf("Lose ");
    else
      printf("Loop ");
}
