#include <bits/stdc++.h>
using namespace std;
const long long mod = 1000000007;
long long powmod(long long a, long long b) {
  long long res = 1;
  a %= mod;
  for (; b; b >>= 1) {
    if (b & 1) res = res * a % mod;
    a = a * a % mod;
  }
  return res;
}
const int N = 7003;
int K[2];
int S[2][N];
int dp[2][N];
int num[2][N];
int main() {
  ios ::sync_with_stdio(false);
  cin.tie(0);
  cout.precision(10);
  cout << fixed;
  int n;
  cin >> n;
  for (int k = 0; k <= 1; k++) {
    cin >> K[k];
    for (int i = 0; i < K[k]; i++) {
      cin >> S[k][i];
    }
    for (int i = 0; i < n; i++) {
      num[k][i] = K[k];
      ;
    }
  }
  dp[0][0] = dp[1][0] = -1;
  queue<pair<int, int> > q;
  q.push({0, 0});
  q.push({1, 0});
  while (!q.empty()) {
    auto a = q.front();
    q.pop();
    int k = a.first;
    int pos = a.second;
    if (dp[k][pos] == -1) {
      for (int i = 0; i < K[k ^ 1]; i++) {
        int step = S[k ^ 1][i];
        if (num[k ^ 1][(pos - step + n) % n] > 0) {
          num[k ^ 1][(pos - step + n) % n] = 0;
          dp[k ^ 1][(pos - step + n) % n] = 1;
          q.push({k ^ 1, (pos - step + n) % n});
        }
      }
    } else if (dp[k][pos] == 1) {
      for (int i = 0; i < K[k ^ 1]; i++) {
        int step = S[k ^ 1][i];
        if (num[k ^ 1][(pos - step + n) % n] > 0) {
          num[k ^ 1][(pos - step + n) % n]--;
          if (num[k ^ 1][(pos - step + n) % n] == 0) {
            dp[k ^ 1][(pos - step + n) % n] = -1;
            q.push({k ^ 1, (pos - step + n) % n});
          }
        }
      }
    }
  }
  for (int k = 0; k <= 1; k++) {
    for (int i = 1; i < n; i++) {
      if (i > 1) {
        cout << " ";
      }
      if (dp[k][i] == 1) {
        cout << "Win";
      } else if (dp[k][i] == 0) {
        cout << "Loop";
      } else {
        cout << "Lose";
      }
    }
    cout << "\n";
  }
}
