#include <bits/stdc++.h>
using namespace std;
const double pi = acos(-1.0);
const double eps = 1e-9;
const int N = 7005;
int n, a, k[2], sz[2 * N];
bool was[2 * N], win[2 * N];
vector<short int> f[2 * N];
queue<int> q;
int main() {
  ios::sync_with_stdio(false);
  cin >> n;
  for (int i = 0; i < 2; i++) {
    cin >> k[i];
    for (int j = 0; j < k[i]; j++) {
      cin >> a;
      for (int t = 1; t < n; t++) {
        int to = t + a;
        if (to >= n) to -= n;
        int toPlayer = 1 - i;
        f[toPlayer * n + to].push_back(i * n + t);
        sz[i * n + t]++;
      }
    }
  }
  for (int i = 0; i < 2 * n; i++)
    if (sz[i] == 0) {
      q.push(i);
      was[i] = true;
    }
  while (!q.empty()) {
    int t = q.front();
    q.pop();
    for (int i = 0; i < f[t].size(); i++) {
      int to = f[t][i];
      if (was[to]) continue;
      if (win[t]) {
        sz[to]--;
        if (sz[to] == 0) {
          was[to] = true;
          q.push(to);
        }
      } else {
        was[to] = true;
        win[to] = true;
        q.push(to);
      }
    }
  }
  for (int i = 1; i < n; i++) {
    if (!was[i]) {
      printf("Loop ");
      continue;
    }
    if (win[i]) {
      printf("Win ");
      continue;
    }
    printf("Lose ");
  }
  printf("\n");
  for (int i = 1 + n; i < n * 2; i++) {
    if (!was[i]) {
      printf("Loop ");
      continue;
    }
    if (win[i]) {
      printf("Win ");
      continue;
    }
    printf("Lose ");
  }
  return 0;
}
