CF936B.Sleepy Game

Petya and Vasya arranged a game. The game runs by the following rules. Players have a directed graph consisting of n vertices and m edges. One of the vertices contains a chip. Initially the chip is located at vertex s. Players take turns moving the chip along some edge of the graph. Petya goes first. Player who can't move the chip loses. If the game lasts for 106 turns the draw is announced.

Vasya was performing big laboratory work in "Spelling and parts of speech" at night before the game, so he fell asleep at the very beginning of the game. Petya decided to take the advantage of this situation and make both Petya's and Vasya's moves.

Your task is to help Petya find out if he can win the game or at least draw a tie.

佩佳和瓦夏设计了一个游戏。游戏规则如下：两名玩家拥有一张包含 $n$ 个顶点和 $m$ 条有向边的有向图。图中某个顶点上放置一枚棋子，初始时棋子位于顶点 $s$。双方轮流沿图中的一条有向边移动棋子，佩佳先手。无法移动棋子的玩家判负。若游戏持续达到 $10^6$ 回合，则判定为平局。

瓦夏在游戏前夜通宵完成了“拼写与词性”大型实验作业，因此游戏一开始便睡着了。佩佳决定利用这一情况，同时代自己和瓦夏走棋。

你的任务是帮助佩佳判断：他是否能确保获胜，或者至少能保证平局。

The first line of input contain two integers n and m — the number of vertices and the number of edges in the graph (2 ≤ n ≤ 105, 0 ≤ m ≤ 2·105).

The next n lines contain the information about edges of the graph. i-th line (1 ≤ i ≤ n) contains nonnegative integer c__i — number of vertices such that there is an edge from i to these vertices and c__i distinct integers a__i, j — indices of these vertices (1 ≤ a__i, j ≤ n, a__i, j ≠ i).

It is guaranteed that the total sum of c__i equals to m.

The next line contains index of vertex s — the initial position of the chip (1 ≤ s ≤ n).

输入的第一行包含两个整数 $n$ 和 $m$ —— 分别表示图中顶点的数量和边的数量（$2 \leq n \leq 10^5$，$0 \leq m \leq 2\cdot10^5$）。

接下来的 $n$ 行描述图中的边。第 $i$ 行（$1 \leq i \leq n$）包含一个非负整数 $c_i$ —— 表示从顶点 $i$ 出发的边所指向的顶点个数，以及 $c_i$ 个互不相同的整数 $a_{i,j}$ —— 这些顶点的编号（$1 \leq a_{i,j} \leq n$，且 $a_{i,j} \neq i$）。

保证所有 $c_i$ 的总和等于 $m$。

下一行包含顶点 $s$ 的编号 —— 即棋子的初始位置（$1 \leq s \leq n$）。

If Petya can win print «Win» in the first line. In the next line print numbers _v_1, _v_2, ..., v__k (1 ≤ k ≤ 106) — the sequence of vertices Petya should visit for the winning. Vertex _v_1 should coincide with s. For i = 1... k - 1 there should be an edge from v__i to v__i + 1 in the graph. There must be no possible move from vertex v__k. The sequence should be such that Petya wins the game.

If Petya can't win but can draw a tie, print «Draw» in the only line. Otherwise print «Lose».

如果Petya能够获胜，则在第一行输出«Win»。在下一行输出数字 $v_1,\ v_2,\ \dots,\ v_k$（其中 $1\le k\le 10^6$）——即Petya为获胜应访问的顶点序列。顶点 $v_1$ 必须与 $s$ 重合；对每个 $i = 1,\dots, k-1$，图中必须存在一条从 $v_i$ 到 $v_{i+1}$ 的边；且从顶点 $v_k$ 出发不能进行任何移动。该序列需保证Petya赢得游戏。

如果Petya无法获胜但可逼成平局，则仅在一行中输出«Draw»；否则输出«Lose»。

In the first example the graph is the following:

Initially the chip is located at vertex 1. In the first move Petya moves the chip to vertex 2, after that he moves it to vertex 4 for Vasya. After that he moves to vertex 5. Now it is Vasya's turn and there is no possible move, so Petya wins.

In the second example the graph is the following:

Initially the chip is located at vertex 2. The only possible Petya's move is to go to vertex 1. After that he has to go to 3 for Vasya. Now it's Petya's turn but he has no possible move, so Petya loses.

In the third example the graph is the following:

Petya can't win, but he can move along the cycle, so the players will draw a tie.

在第一个例子中，图如下所示：

初始时，棋子位于顶点 1。第一步，Petya 将棋子移至顶点 2；接着，他为 Vasya 将棋子移至顶点 4；然后，他再将棋子移至顶点 5。此时轮到 Vasya 行动，但他已无合法移动，因此 Petya 获胜。

在第二个例子中，图如下所示：

初始时，棋子位于顶点 2。Petya 唯一的合法移动是前往顶点 1；接着，他必须为 Vasya 将棋子移至顶点 3。此时轮到 Petya 行动，但他已无合法移动，因此 Petya 失败。

在第三个例子中，图如下所示：

Petya 无法获胜，但他可以在环上持续移动，因此双方将陷入平局。