#include <bits/stdc++.h>
using namespace std;
int n, k[2], lis[2][7777], dp[2][7777], vst[2][7777], ans[2][7777];
queue<int> qx, qi;
int main() {
  ios::sync_with_stdio(false);
  cin >> n;
  for (int i = (0); i <= ((int)(2) - 1); i++) {
    cin >> k[i];
    for (int j = (0); j <= ((int)(k[i]) - 1); j++) cin >> lis[i][j];
  }
  for (int i = (0); i <= ((int)(2) - 1); i++)
    for (int j = (0); j <= ((int)(n)-1); j++) dp[i][j] = k[i];
  qi.push(0);
  qi.push(1);
  qx.push(0);
  qx.push(0);
  vst[0][0] = vst[1][0] = 1;
  ans[0][0] = ans[1][0] = 2;
  while (!qi.empty()) {
    int player = qi.front();
    qi.pop();
    int x = qx.front();
    qx.pop();
    int other = 1 - player;
    if (ans[player][x] == 2) {
      for (int i = (0); i <= ((int)(k[other]) - 1); i++) {
        int prev = (x + n - lis[other][i]) % n;
        if (vst[other][prev]) continue;
        vst[other][prev] = 1;
        ans[other][prev] = 1;
        qx.push(prev);
        qi.push(other);
      }
    } else {
      for (int i = (0); i <= ((int)(k[other]) - 1); i++) {
        int prev = (x + n - lis[other][i]) % n;
        if (vst[other][prev]) continue;
        dp[other][prev]--;
        if (!dp[other][prev]) {
          vst[other][prev] = 1;
          ans[other][prev] = 2;
          qx.push(prev);
          qi.push(other);
        }
      }
    }
  }
  for (int i = (0); i <= ((int)(2) - 1); i++) {
    for (int j = (1); j <= (n - 1); j++) {
      if (ans[i][j] == 1)
        cout << "Win ";
      else if (ans[i][j])
        cout << "Lose ";
      else
        cout << "Loop ";
    }
    cout << endl;
  }
}
