#include <bits/stdc++.h>
using namespace std;
const int maxn = 7070;
int n;
int a, b;
int ga[maxn];
int gb[maxn];
bool Wa[maxn], La[maxn];
bool Wb[maxn], Lb[maxn];
int A[maxn];
int B[maxn];
set<int> la, lb;
int main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  cin >> n;
  {
    cin >> a;
    for (int i = 0; i < a; i++) cin >> ga[i];
  }
  {
    cin >> b;
    for (int i = 0; i < b; i++) cin >> gb[i];
  }
  la.insert(n - 1);
  lb.insert(n - 1);
  A[n - 1] = n + 1;
  B[n - 1] = n + 1;
  Wa[n - 1] = true;
  Wb[n - 1] = true;
  for (int x, y, z; la.size() or lb.size();)
    if (la.size()) {
      x = *la.begin();
      la.erase(x);
      La[x] = true;
      for (int i = 0; i < b; i++) {
        y = (x - gb[i] + n) % n;
        if (!Wb[y]) {
          Wb[y] = true;
          for (int j = 0; j < a; j++) {
            z = (y - ga[j] + n) % n;
            A[z]++;
            if (A[z] == a) la.insert(z);
          }
        }
      }
    } else {
      int x = *lb.begin();
      lb.erase(x);
      Lb[x] = true;
      for (int i = 0; i < a; i++) {
        y = (x - ga[i] + n) % n;
        if (!Wa[y]) {
          Wa[y] = true;
          for (int j = 0; j < b; j++) {
            z = (y - gb[j] + n) % n;
            B[z]++;
            if (B[z] == b) lb.insert(z);
          }
        }
      }
    }
  for (int i = 0; i < n - 1; i++)
    if (Wa[i])
      cout << "Win ";
    else if (La[i])
      cout << "Lose ";
    else
      cout << "Loop ";
  cout << endl;
  for (int i = 0; i < n - 1; i++)
    if (Wb[i])
      cout << "Win ";
    else if (Lb[i])
      cout << "Lose ";
    else
      cout << "Loop ";
  cout << endl;
  return 0;
}
