#include <bits/stdc++.h>
using namespace std;
const double eps = 1e-9;
const int inf = 2000000000;
const long long infLL = 9000000000000000000;
template <typename first, typename second>
ostream& operator<<(ostream& os, const pair<first, second>& p) {
  return os << "(" << p.first << ", " << p.second << ")";
}
template <typename T>
ostream& operator<<(ostream& os, const vector<T>& v) {
  os << "{";
  for (auto it = v.begin(); it != v.end(); ++it) {
    if (it != v.begin()) os << ", ";
    os << *it;
  }
  return os << "}";
}
template <typename T>
ostream& operator<<(ostream& os, const set<T>& v) {
  os << "[";
  for (auto it = v.begin(); it != v.end(); ++it) {
    if (it != v.begin()) os << ",";
    os << *it;
  }
  return os << "]";
}
template <typename T>
ostream& operator<<(ostream& os, const multiset<T>& v) {
  os << "[";
  for (auto it = v.begin(); it != v.end(); ++it) {
    if (it != v.begin()) os << ", ";
    os << *it;
  }
  return os << "]";
}
template <typename first, typename second>
ostream& operator<<(ostream& os, const map<first, second>& v) {
  os << "[";
  for (auto it = v.begin(); it != v.end(); ++it) {
    if (it != v.begin()) os << ", ";
    os << it->first << " = " << it->second;
  }
  return os << "]";
}
void faltu() { cerr << '\n'; }
template <typename T>
void faltu(T a[], int n) {
  for (int i = 0; i < n; ++i) cerr << a[i] << ' ';
  cerr << '\n';
}
template <typename T, typename... hello>
void faltu(T arg, const hello&... rest) {
  cerr << arg << ' ';
  faltu(rest...);
}
int n;
int k[2];
int s[2][7005];
int dp[2][7005];
int b[2][7005];
queue<pair<int, int> > q;
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  ;
  memset(dp, -1, sizeof(dp));
  cin >> n;
  for (int i = 0; i < 2; ++i) {
    cin >> k[i];
    for (int j = 0; j < k[i]; ++j) {
      cin >> s[i][j];
    }
  }
  dp[0][1] = dp[1][1] = 0;
  q.push(make_pair(0, 1));
  q.push(make_pair(1, 1));
  while (!q.empty()) {
    pair<int, int> p = q.front();
    q.pop();
    for (int i = 0; i < k[p.first ^ 1]; ++i) {
      int node = p.second - s[p.first ^ 1][i];
      if (node < 1) node += n;
      if (dp[p.first ^ 1][node] == -1) {
        dp[p.first ^ 1][node] = 1;
        for (int j = 0; j < k[p.first]; ++j) {
          int node2 = node - s[p.first][j];
          if (node2 < 1) node2 += n;
          if (dp[p.first][node2] == -1) {
            ++b[p.first][node2];
            if (b[p.first][node2] == k[p.first]) {
              dp[p.first][node2] = 0;
              q.push(make_pair(p.first, node2));
            }
          }
        }
      }
    }
  }
  for (int i = 2; i <= n; ++i) {
    if (dp[0][i] == -1)
      cout << "Loop ";
    else if (dp[0][i] == 1)
      cout << "Win ";
    else if (dp[0][i] == 0)
      cout << "Lose ";
  }
  cout << '\n';
  for (int i = 2; i <= n; ++i) {
    if (dp[1][i] == -1)
      cout << "Loop ";
    else if (dp[1][i] == 1)
      cout << "Win ";
    else if (dp[1][i] == 0)
      cout << "Lose ";
  }
  cout << '\n';
}
