Heaps

Nini and Mimi are playing a game with $N$ heaps of stones and pebbles. Each heap $i$ has $B_i$ big stones and $S_i$ small pebbles. The players take turns making moves, and a player who has no move left loses. A move chooses a non-empty heap $i$ and removes some stones and/or pebbles from it. Specifically, the player removes $X$ stones and $Y$ pebbles, where $0 \le X \le B_i$, $0 \le Y \le S_i$, and $X + Y > 0$. Every removed stone must be replaced with at least $K$ pebbles. So when $X \ge 1$, the player first removes $Y$ pebbles, then adds back $Z$ pebbles from an infinite supply, where $Z \ge KX$ and $Z$ is a natural number. Nini moves first. Before her move, she wants to know whether she can win if both players play optimally.

The first line contains $K$ and $Q$. Then $Q$ independent tests follow, all using the same $K$. Each test starts with a line containing $N$. The next $N$ lines each contain $B_i$ and $S_i$ for one heap.

Print $Q$ lines, one answer per test, in the input order. Print Win if Nini can win, and Loss otherwise.

• $1 \le Q \le 10$
• $1 \le N \le 10^4$
• $0 \le K, B_i \le 3000$
• $0 \le S_i \le 10^7$