#include <iostream>
#include <stdio.h>
#include <vector>
#include <string>
#include <math.h>
#include <algorithm>
#include <map>
#include <set>
#include <sstream>
#include <queue>

#define sz(x) ((int)x.size())
#define all(x) (x).begin(), (x).end()
#define pb(x) push_back(x)
#define mp(x, y) make_pair(x, y)

typedef long long int64;

using namespace std;

vector<vector<int>> g;
vector<bool> win;
vector<bool> loose;
vector<bool> used;
vector<int> degree;

void dfs (int v) {
    used[v] = true;
    for (int i : g[v])
        if (!used[i]) {
            if (loose[v])
                win[i] = true;
            else if (--degree[i] == 0)
                loose[i] = true;
            else
                continue;
            dfs (i);
        }
}

int main() {
    int n;
    cin >> n;
    int k1;
    cin >> k1;
    vector<int> moves1(k1);
    for (int i = 0; i < k1; ++i) {
        cin >> moves1[i];
    }
    int k2;
    cin >> k2;
    vector<int> moves2(k2);
    for (int i = 0; i < k2; ++i) {
        cin >> moves2[i];
    }
    g.resize(2*n);
    for (int i = 0; i < n; ++i) {
        for (int x : moves2) {
            if ((i - x) % n != 0) {
                g[i].pb(n + (n + i - x) % n);
            }
        }
    }
    for (int i = n; i < 2 * n; ++i) {
        for (int x : moves1) {
            if ((i - x) % n != 0) {
                g[i].pb((n + i - x) % n);
            }
        }
    }
    win.assign(2 * n, false);
    loose.assign(2 * n, false);
    used.assign(2 *n, false);
    loose[0] = true;
    loose[n] = true;
    degree.resize(2 * n);
    for (int i = 0; i < n; ++i) {
        degree[i] = k1;
    }
    for (int i = n; i < 2 * n; ++i) {
        degree[i] = k2;
    }

    dfs(0);
    if (!used[n]) dfs(n);

    for (int i = 1; i < n; ++i) {
        if (win[i]) {
            cout << "Win ";
            continue;
        }
        if (loose[i]) {
            cout << "Lose ";
            continue;
        }
        cout << "Loop ";
    }
    cout << endl;
    for (int i = n + 1; i < 2 * n; ++i) {
        if (win[i]) {
            cout << "Win ";
            continue;
        }
        if (loose[i]) {
            cout << "Lose ";
            continue;
        }
        cout << "Loop ";
    }
    return 0;
}