Virtual contest is a way to take part in past contest, as close as possible to participation on time. It is supported only ICPC mode for virtual contests.
If you've seen these problems, a virtual contest is not for you - solve these problems in the archive.
If you just want to solve some problem from a contest, a virtual contest is not for you - solve this problem in the archive.
Never use someone else's code, read the tutorials or communicate with other person during a virtual contest.

No tag edit access

The problem statement has recently been changed. View the changes.

×
A. Berzerk

time limit per test

4 secondsmemory limit per test

256 megabytesinput

standard inputoutput

standard outputRick and Morty are playing their own version of Berzerk (which has nothing in common with the famous Berzerk game). This game needs a huge space, so they play it with a computer.

In this game there are *n* objects numbered from 1 to *n* arranged in a circle (in clockwise order). Object number 1 is a black hole and the others are planets. There's a monster in one of the planet. Rick and Morty don't know on which one yet, only that he's not initially in the black hole, but Unity will inform them before the game starts. But for now, they want to be prepared for every possible scenario.

Each one of them has a set of numbers between 1 and *n* - 1 (inclusive). Rick's set is *s*_{1} with *k*_{1} elements and Morty's is *s*_{2} with *k*_{2} elements. One of them goes first and the player changes alternatively. In each player's turn, he should choose an arbitrary number like *x* from his set and the monster will move to his *x*-th next object from its current position (clockwise). If after his move the monster gets to the black hole he wins.

Your task is that for each of monster's initial positions and who plays first determine if the starter wins, loses, or the game will stuck in an infinite loop. In case when player can lose or make game infinity, it more profitable to choose infinity game.

Input

The first line of input contains a single integer *n* (2 ≤ *n* ≤ 7000) — number of objects in game.

The second line contains integer *k*_{1} followed by *k*_{1} distinct integers *s*_{1, 1}, *s*_{1, 2}, ..., *s*_{1, k1} — Rick's set.

The third line contains integer *k*_{2} followed by *k*_{2} distinct integers *s*_{2, 1}, *s*_{2, 2}, ..., *s*_{2, k2} — Morty's set

1 ≤ *k*_{i} ≤ *n* - 1 and 1 ≤ *s*_{i, 1}, *s*_{i, 2}, ..., *s*_{i, ki} ≤ *n* - 1 for 1 ≤ *i* ≤ 2.

Output

In the first line print *n* - 1 words separated by spaces where *i*-th word is "Win" (without quotations) if in the scenario that Rick plays first and monster is initially in object number *i* + 1 he wins, "Lose" if he loses and "Loop" if the game will never end.

Similarly, in the second line print *n* - 1 words separated by spaces where *i*-th word is "Win" (without quotations) if in the scenario that Morty plays first and monster is initially in object number *i* + 1 he wins, "Lose" if he loses and "Loop" if the game will never end.

Examples

Input

5

2 3 2

3 1 2 3

Output

Lose Win Win Loop

Loop Win Win Win

Input

8

4 6 2 3 4

2 3 6

Output

Win Win Win Win Win Win Win

Lose Win Lose Lose Win Lose Lose

Codeforces (c) Copyright 2010-2021 Mike Mirzayanov

The only programming contests Web 2.0 platform

Server time: Apr/15/2021 18:20:23 (f2).

Desktop version, switch to mobile version.

Supported by

User lists

Name |
---|