#include <bits/stdc++.h>
using namespace std;
const int N = 7004;
int vis[2][N], cnt[2][N];
int main() {
  ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
  int n;
  cin >> n;
  int sz;
  cin >> sz;
  vector<vector<int> > v(2, vector<int>());
  v[0].resize(sz);
  for (int &x : v[0]) cin >> x;
  cin >> sz;
  v[1].resize(sz);
  for (int &x : v[1]) cin >> x;
  queue<pair<int, int> > q;
  q.push({1, 0});
  q.push({0, 0});
  vis[1][0] = vis[0][0] = 1;
  while (!q.empty()) {
    pair<int, int> top = q.front();
    q.pop();
    for (int x : v[!top.first]) {
      int nxt = (top.second - x + n) % n;
      if (vis[!top.first][nxt]) continue;
      if (vis[top.first][top.second] == 1) {
        vis[!top.first][nxt] = 2;
      } else {
        cnt[!top.first][nxt]++;
        if (cnt[!top.first][nxt] == (int)v[!top.first].size()) {
          vis[!top.first][nxt] = 1;
        }
      }
      if (vis[!top.first][nxt]) {
        q.push({!top.first, nxt});
      }
    }
  }
  for (int i = 0; i <= 1; ++i) {
    for (int j = 1; j < n; ++j) {
      if (vis[i][j] == 0) {
        cout << "Loop ";
      } else {
        cout << (vis[i][j] == 2 ? "Win" : "Lose") << " ";
      }
    }
    cout << "\n";
  }
}
