#include <bits/stdc++.h>
using namespace std;
int n;
int k1, k2;
vector<int> a[2];
int found[7000][2];
int dp[7000][2];
queue<pair<int, int>> q;
int main() {
  cin >> n >> k1;
  for (int i = 0; i < k1; ++i) {
    int x;
    cin >> x;
    a[0].push_back(x);
  }
  cin >> k2;
  for (int i = 0; i < k2; ++i) {
    int x;
    cin >> x;
    a[1].push_back(x);
  }
  dp[0][1] = dp[0][0] = 9;
  q.push({0, 0});
  q.push({0, 1});
  while (!q.empty()) {
    int i = q.front().first, p = q.front().second;
    q.pop();
    for (int x : a[!p]) {
      int j = (n + i - x) % n;
      found[j][!p]++;
      if (dp[j][!p] != 0) continue;
      if (dp[i][p] == 9) {
        dp[j][!p] = 11;
        q.push({j, !p});
      } else if (found[j][!p] == a[!p].size()) {
        dp[j][!p] = 9;
        q.push({j, !p});
      }
    }
  }
  for (int i = 0; i < 2; ++i) {
    for (int j = 1; j < n; ++j) {
      if (j != 1) cout << " ";
      if (dp[j][i] == 11)
        cout << "Win";
      else if (dp[j][i] == 0)
        cout << "Loop";
      else if (dp[j][i] == 9)
        cout << "Lose";
    }
    cout << "\n";
  }
}
