Codeforces Round 406 (Div. 2)
C
Berzerk
Codeforces
未评级
原题
← BD →
翻译中…

Rick 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.

翻译中…

image

翻译中…

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, *k*_{1}}$ — Rick's set.

翻译中…

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

翻译中…

$1 ≤ *k*_{*i*} ≤ *n* - 1$ and $1 ≤ *s*_{*i*, 1}, *s*_{*i*, 2}, ..., *s*_{*i*, *k*_{*i*}} ≤ *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.

翻译中…

样例

Input #1
5
2 3 2
3 1 2 3
Output #1
Lose Win Win Loop
Loop Win Win Win
InputCopy OutputCopy
Input #2
8
4 6 2 3 4
2 3 6
Output #2
Win Win Win Win Win Win Win
Lose Win Lose Lose Win Lose Lose
InputCopy OutputCopy
题目信息
题号
787C
时间限制
4 s
内存限制
256 MB

题面与样例版权归 Codeforces 及出题人所有;中文翻译由 AI 生成(CI 管线),如有出入请以原文为准。