Problem: 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.

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 ≤ 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 ci — number of vertices such that there is an edge from i to these vertices and ci distinct integers ai, j — indices of these vertices (1 ≤ ai, j ≤ n, ai, j ≠ i).

It is guaranteed that the total sum of ci 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 v1, v2, ..., vk (1 ≤ k ≤ 106) — the sequence of vertices Petya should visit for the winning. Vertex v1 should coincide with s. For i = 1... k - 1 there should be an edge from vi to vi + 1 in the graph. There must be no possible move from vertex vk. 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».

Examples

Input

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


Output

Win
1 2 4 5 


Input

3 2
1 3
1 1
0
2


Output

Lose


Input

2 2
1 2
1 1
1


Output

Draw

Note

In the first example the graph is the following:

<image>

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:

<image>

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:

<image>

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

Solution (in JAVA):

Solution:
import java.io.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.Collection;
import java.io.InputStreamReader;
import java.util.Stack;
import java.util.Vector;
import java.util.StringTokenizer;
import java.util.Queue;
import java.io.BufferedReader;
import java.util.LinkedList;
import java.io.InputStream;

/**
 * Built using CHelper plug-in
 * Actual solution is at the top
 */
public class Main {
    public static void main(String[] args) {
        InputStream inputStream = System.in;
        OutputStream outputStream = System.out;
        Scanner in = new Scanner(inputStream);
        PrintWriter out = new PrintWriter(outputStream);
        TaskD solver = new TaskD();
        solver.solve(1, in, out);
        out.close();
    }

    static class TaskD {
        int n;
        int m;
        int[][] adjList;
        int[] state;
        int VISITED = 1;
        int UNVISITED = 0;
        int EXPLORED = 2;
        boolean cycleExist;

        void dfs(int node) {
            state[node] = EXPLORED;
            for (int nxt : adjList[node])
                if (state[nxt] == EXPLORED)
                    cycleExist = true;
                else if (state[nxt] == UNVISITED)
                    dfs(nxt);
            state[node] = VISITED;
        }

        public void solve(int testNumber, Scanner sc, PrintWriter out) {
            n = sc.nextInt();
            m = sc.nextInt();
            state = new int[n];
            int[] to = new int[m], from = new int[m];
            boolean[] dead = new boolean[n];
            Arrays.fill(dead, true);
            for (int i = 0, idx = 0; i < n; i++) {
                int c = sc.nextInt();
                while (c-- > 0) {
                    to[idx] = sc.nextInt() - 1;
                    from[idx] = i;
                    dead[from[idx++]] = false;
                }
            }
            PACK(to, from);
            boolean[][] visited = new boolean[n][2];
            int[][] p = new int[n][2];
            Queue<Integer> q = new LinkedList<>();
            int start = sc.nextInt() - 1;
            q.add(start);
            q.add(0);
            visited[start][0] = true;
            int last = -1;
            while (!q.isEmpty()) {
                int node = q.poll(), parity = q.poll();
                if (parity == 1 && dead[node]) {
                    last = node;
                    break;
                }
                for (int nxt : adjList[node])
                    if (!visited[nxt][1 ^ parity]) {
                        visited[nxt][1 ^ parity] = true;
                        p[nxt][1 ^ parity] = node;
                        q.add(nxt);
                        q.add(1 ^ parity);
                    }
            }
            if (last != -1) {
                out.println("Win");
                int parity = 1;
                Stack<Integer> s = new Stack<>();
                while (last != start || parity != 0) {
                    s.add(last);
                    last = p[last][parity];
                    parity ^= 1;
                }
                s.add(last);
                out.print(s.pop() + 1);
                while (!s.isEmpty())
                    out.print(" " + (s.pop() + 1));
                out.println();
            } else {
                dfs(start);

                if (cycleExist) {
                    out.println("Draw");
                } else {
                    out.println("Lose");
                }
            }
        }

        void PACK(int[] to, int[] from) {
            adjList = new int[n][];
            int[] idx = new int[n];
            for (int i = 0; i < m; i++)
                idx[from[i]]++;
            for (int i = 0; i < n; i++)
                adjList[i] = new int[idx[i]];
            for (int i = 0; i < to.length; i++)
                adjList[from[i]][--idx[from[i]]] = to[i];
        }

    }

    static class Scanner {
        StringTokenizer st;
        BufferedReader br;

        public Scanner(InputStream s) {
            br = new BufferedReader(new InputStreamReader(s));
        }

        public String next() {
            while (st == null || !st.hasMoreTokens()) {
                try {
                    st = new StringTokenizer(br.readLine());
                } catch (Exception e) {
                }
                ;
            }
            return st.nextToken();
        }

        public int nextInt() {
            return Integer.parseInt(next());
        }

    }
}