Sleepy Game

Description:

Input:

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 ≤ 10⁵, 0 ≤ m ≤ 2·10⁵).

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

Output:

If Petya can win print «Win» in the first line. In the next line print numbers v₁, v₂, ..., v_k (1 ≤ k ≤ 10⁶) — the sequence of vertices Petya should visit for the winning. Vertex v₁ 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».

Sample Input:

5 6
2 2 3
2 4 5
1 4
1 5
0
1

Sample Output:

Win
1 2 4 5 

Sample Input:

3 2
1 3
1 1
0
2

Sample Output:

Lose

Sample Input:

2 2
1 2
1 1
1

Sample Output:

Draw

Note:

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.