#include <bits/stdc++.h>
using namespace std;
inline long long int modadd(long long int n, long long int m,
                            long long int p = 1000000007) {
  return ((n + m) % p + p) % p;
}
inline long long int modsub(long long int n, long long int m,
                            long long int p = 1000000007) {
  return ((n - m + p) % p + p) % p;
}
inline long long int modpro(long long int n, long long int m,
                            long long int p = 1000000007) {
  return (((n % p) * (m % p)) % p + p) % p;
}
unsigned long long int powe(long long int first, long long int second) {
  unsigned long long int res = 1;
  while (second > 0) {
    if (second & 1) res = res * first;
    second = second >> 1;
    first = first * first;
  }
  return res;
}
long long int modpow(long long int first, long long int second,
                     long long int p = 1000000007) {
  long long int res = 1;
  while (second > 0) {
    if (second & 1) res = modpro(res, first, p);
    second = second >> 1;
    first = modpro(first, first, p);
  }
  return res;
}
inline long long int modInverse(long long int n, long long int p = 1000000007) {
  if (n == 1) return 1;
  return modpow(n, p - 2, p);
}
inline long long int moddiv(long long int n, long long int m,
                            long long int p = 1000000007) {
  return modpro(n, modInverse(m, p), p);
}
inline long long int modadd3(long long int first, long long int second,
                             long long int z, long long int p = 1000000007) {
  return modadd(modadd(first, second, p), z, p);
}
inline long long int modadd4(long long int first, long long int second,
                             long long int z, long long int w,
                             long long int p = 1000000007) {
  return modadd(modadd(first, second, p), modadd(z, w, p), p);
}
inline long long int modnCr(long long int fac[], int n, int r,
                            long long int p = 1000000007) {
  if (r == 0) return 1;
  return modpro(fac[n], modInverse(modpro(fac[r], fac[n - r], p), p), p);
}
template <typename T>
inline T max3(T first, T second, T z) {
  return max(max(first, second), z);
}
template <typename T>
inline T max4(T first, T second, T z, T w) {
  return max(max3(first, second, w), z);
}
template <typename T>
inline T min3(T first, T second, T z) {
  return min(min(first, second), z);
}
template <typename T>
inline T min4(T first, T second, T z, T w) {
  return min(min3(first, second, w), z);
}
template <typename T>
void printArr(T *arr, int s, int n) {
  for (int i = s; i <= n; i++) {
    cout << arr[i] << " ";
  }
  cout << endl;
}
vector<int> r[2];
int n;
int dp[7005][2];
int cnt[7005][2];
int vis[7005][2];
queue<pair<int, int> > q;
int main() {
  std::ios::sync_with_stdio(false);
  cin.tie(NULL);
  int erer = 1;
  for (int erer2 = (1); erer2 < (erer + 1); erer2++) {
    cin >> n;
    int k;
    cin >> k;
    int first;
    for (int i = (0); i < (k); i++) {
      cin >> first;
      r[0].push_back(first);
      dp[n - first][0] = 1;
    }
    cin >> k;
    for (int i = (0); i < (k); i++) {
      cin >> first;
      r[1].push_back(first);
      dp[n - first][1] = 1;
    }
    dp[0][0] = -1;
    dp[0][1] = -1;
    vis[0][0] = 1;
    vis[0][1] = 1;
    q.push({0, 0});
    q.push({0, 1});
    while (!q.empty()) {
      auto u = q.front();
      q.pop();
      for (int first : r[!u.second]) {
        int pos = modsub(u.first, first, n);
        if (!vis[pos][!u.second]) {
          if (dp[u.first][u.second] == -1) {
            vis[pos][!u.second] = 1;
            dp[pos][!u.second] = 1;
            q.push({pos, !u.second});
          } else {
            cnt[pos][!u.second]++;
            if (cnt[pos][!u.second] == ((long long int)(r[!u.second]).size())) {
              vis[pos][!u.second] = 1;
              dp[pos][!u.second] = -1;
              q.push({pos, !u.second});
            }
          }
        }
      }
    }
    for (int i = (1); i < (n); i++)
      if (dp[i][0] == -1)
        cout << "Lose ";
      else if (dp[i][0] == 1)
        cout << "Win ";
      else
        cout << "Loop ";
    cout << endl;
    for (int i = (1); i < (n); i++)
      if (dp[i][1] == -1)
        cout << "Lose ";
      else if (dp[i][1] == 1)
        cout << "Win ";
      else
        cout << "Loop ";
    cout << endl;
  }
  return 0;
}
