#include <bits/stdc++.h>
using namespace std;
vector<vector<int> > a;
vector<vector<int> > dp;
int n;
queue<vector<int> > q;
int main() {
  cin >> n;
  a = vector<vector<int> >(2);
  int k;
  cin >> k;
  a[0] = vector<int>(k);
  for (int i = 0; i < (int)(k); i++) cin >> a[0][i];
  cin >> k;
  a[1] = vector<int>(k);
  for (int i = 0; i < (int)(k); i++) cin >> a[1][i];
  dp = vector<vector<int> >(2, vector<int>(n, -1));
  dp[0][0] = dp[1][0] = 0;
  q.push({0, 0});
  q.push({1, 0});
  vector<vector<int> > cnt(2, vector<int>(n));
  while (!q.empty()) {
    vector<int> s = q.front();
    q.pop();
    int w = s[0];
    int p = s[1];
    int e = w ^ 1;
    if (dp[w][p] == 0) {
      for (int x : a[e]) {
        int pr = (p + n - x) % n;
        if (dp[e][pr] == -1) {
          dp[e][pr] = 1;
          q.push({e, pr});
        }
      }
    } else {
      for (int x : a[e]) {
        int pr = (p + n - x) % n;
        cnt[e][pr]++;
        if (cnt[e][pr] == (int)a[e].size()) {
          dp[e][pr] = 0;
          q.push({e, pr});
        }
      }
    }
  }
  for (int w = 0; w < (int)(2); w++) {
    for (int i = 1; i < n; i++) {
      if (dp[w][i] == 1)
        printf("Win ");
      else if (dp[w][i] == 0)
        printf("Lose ");
      else
        printf("Loop ");
    }
    cout << endl;
  }
  return 0;
}
