#include <bits/stdc++.h>
using namespace std;
const long long MOD = 1e9 + 7;
int vtam[3];
int v[3][310010];
int resp[3][310010];
int arts[3][310010];
int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  int n;
  cin >> n;
  cin >> vtam[0];
  for (long long i = 0; i < vtam[0]; i++) cin >> v[0][i];
  cin >> vtam[1];
  for (long long i = 0; i < vtam[1]; i++) cin >> v[1][i];
  memset(resp, -1, sizeof resp);
  memset(arts, 0, sizeof arts);
  resp[0][0] = resp[1][0] = 0;
  queue<pair<short, short> > cola;
  cola.push(pair<short, short>(0, 0));
  cola.push(pair<short, short>(1, 0));
  int posinv;
  while (!cola.empty()) {
    int posact = cola.front().second;
    int tipo = cola.front().first;
    cola.pop();
    if (resp[tipo][posact] == 1) {
      for (long long i = 0; i < vtam[!tipo]; i++) {
        posinv = ((posact - v[!tipo][i]) + n) % n;
        arts[!tipo][posinv]++;
        if (arts[!tipo][posinv] == vtam[!tipo]) {
          resp[!tipo][posinv] = 0;
          cola.push(pair<short, short>(!tipo, posinv));
        }
      }
    } else {
      for (long long i = 0; i < vtam[!tipo]; i++) {
        posinv = ((posact - v[!tipo][i]) + n) % n;
        if (resp[!tipo][posinv] == -1) {
          resp[!tipo][posinv] = 1;
          cola.push(pair<short, short>(!tipo, posinv));
        }
      }
    }
  }
  for (long long j = 0; j < 2; j++) {
    for (long long i = 1; i < n; i++) {
      if (resp[j][i] == -1)
        cout << "Loop ";
      else if (resp[j][i])
        cout << "Win ";
      else
        cout << "Lose ";
    }
    cout << endl;
  }
}
