#include <bits/stdc++.h>
using namespace std;
int n, dp[7001][2];
vector<int> s[2];
int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  cin >> n;
  memset(dp, -1, sizeof(dp));
  for (int p = 0, k; p < 2; p++) {
    cin >> k;
    s[p].resize(k);
    for (int i = 0; i < k; i++) cin >> s[p][i];
  }
  dp[1][0] = dp[1][1] = 0;
  bool flag = true;
  while (flag) {
    flag = false;
    for (int i = n; i >= 2; i--)
      for (int p = 0; p < 2; p++)
        if (dp[i][p] == -1) {
          bool can = false;
          for (int x : s[p]) {
            int nxt = (i + x) % n + n * !bool((i + x) % n);
            if (!dp[nxt][p ^ 1]) {
              dp[i][p] = 1;
              flag = true;
              can = true;
              break;
            } else if (dp[nxt][p ^ 1] == -1)
              can = true;
          }
          if (!can) dp[i][p] = 0, flag = true;
        }
  }
  for (int p = 0; p < 2; p++, cout << endl)
    for (int i = 2; i <= n; i++) {
      if (dp[i][p] == -1)
        cout << "Loop ";
      else if (dp[i][p] == 1)
        cout << "Win ";
      else
        cout << "Lose ";
    }
}
