11 20
1 2
2 7 6
1 7
4 10 9 3 2
2 9 2
1 3
0
0
3 1 6 7
4 11 7 5 6
2 2 8
4
 5 5
1 2
1 3
2 1 4
1 5
0
1
 5 5
1 2
1 3
2 2 4
1 5
0
1
 4 3
1 2
1 3
1 1
0
1
 6 6
1 2
2 3 6
1 4
0
1 3
1 5
2
 5 5
1 2
2 3 5
1 4
1 2
0
1
 5 5
2 2 3
1 4
1 5
1 3
0
1
 6 6
1 2
2 3 6
1 4
1 5
1 1
0
1
 5 5
1 2
2 4 3
0
1 5
1 2
1
 6 6
2 2 3
1 4
1 4
1 5
1 6
0
1
 5 5
2 2 3
2 4 5
1 5
0
0
1
 5 5
2 2 4
1 3
1 4
1 5
0
1
 57 39
1 57
1 40
1 38
0
0
0
1 20
0
0
1 53
0
0
0
1 36
1 40
1 27
1 11
1 7
1 35
0
1 23
1 44
1 14
1 54
0
1 21
1 28
1 37
1 38
1 26
1 3
0
1 14
0
1 1
1 10
1 52
1 45
0
1 16
0
1 22
1 51
1 48
1 30
1 30
0
1 19
1 33
0
1 45
1 42
1 49
0
1 23
0
1 31
15
 15 20
3 4 9 7
0
1 1
3 5 6 1
1 13
0
4 8 15 4 2
1 7
1 2
0
1 4
0
2 3 11
1 5
2 1 6
4
 5 5
2 2 3
1 4
0
1 5
1 4
2
 6 6
2 2 3
1 4
1 5
0
1 6
1 4
1
 4 4
2 2 4
1 3
1 1
0
3
 2 1
0
1 1
1
 8 8
2 2 5
1 3
1 7
0
1 6
1 8
1 4
1 4
1
 5 5
1 2
1 3
1 4
2 3 5
0
1
 4 4
2 2 3
1 4
1 4
0
1
 5 5
1 2
2 3 4
0
1 5
1 3
1
 6 6
1 2
2 3 4
1 5
1 5
1 6
0
1
 3 2
1 2
1 1
0
3
 5 5
2 2 3
1 5
1 4
1 5
0
1
 92 69
1 76
1 14
1 9
0
1 46
1 80
0
0
1 77
0
1 53
1 81
1 61
1 40
0
1 20
1 71
1 24
1 54
1 82
1 23
0
1 63
1 25
1 38
1 68
0
1 65
0
1 76
1 55
1 87
1 1
1 37
1 68
1 30
1 17
1 19
0
1 16
1 69
0
1 60
1 86
0
1 44
1 32
1 10
1 8
0
0
0
0
0
1 2
1 39
0
1 74
1 5
1 28
1 79
1 32
1 34
0
1 81
1 85
1 6
1 18
0
0
1 58
1 88
1 7
1 78
1 43
1 5
1 61
1 90
1 31
1 75
1 72
1 80
1 13
0
0
1 21
1 70
1 30
0
1 68
1 3
1 62
91
 5 5
2 2 4
1 3
1 1
1 5
0
1
 3 3
1 2
2 1 3
0
1
 6 6
2 2 4
1 3
0
1 5
1 6
1 3
1
 53 38
0
1 35
0
1 32
0
0
1 49
1 25
0
1 19
0
0
1 25
1 48
1 50
1 2
1 4
1 50
1 34
1 4
1 46
0
1 4
1 5
1 43
1 8
1 40
1 47
1 21
1 43
0
1 10
1 27
1 33
1 20
1 26
0
0
0
1 53
0
0
1 45
1 23
1 7
1 52
1 51
0
1 29
1 48
1 36
1 2
1 28
2
 8 8
2 2 3
1 4
1 4
1 5
1 6
0
1 8
1 7
1
 5 5
1 2
1 3
1 4
2 2 5
0
1

Win
4 10 11 8
 Win
1 2 3 1 2 3 4 5
 Draw
 Draw
 Lose
 Win
1 2 3 4 2 5
 Lose
 Win
1 2 3 4 5 1 2 6
 Win
1 2 4 5 2 3
 Lose
 Lose
 Lose
 Draw
 Win
4 5 13 3 1 4 5 13 3 1 9 2
 Draw
 Lose
 Win
3 1 2 3 1 4
 Lose
 Lose
 Draw
 Lose
 Lose
 Lose
 Lose
 Win
1 3 4 5
 Lose
 Win
1 2 3 1 4 5
 Draw
 Lose
 Draw
 Lose
 Win
1 2 3 4 2 3 4 5

import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.*;

public class SolutionD {

	public static void main(String[] args) throws IOException {
		// TODO Auto-generated method stub
		BufferedReader reader = new BufferedReader(new InputStreamReader(System.in));
		String[] temp = reader.readLine().split("[ ]");
		int n = Integer.parseInt(temp[0]);
		int m = Integer.parseInt(temp[1]);

		Node[] nodes = new Node[n];
		State[][] states = new State[n][2];
		for (int i = 0; i < n; i++) {
			nodes[i] = new Node(i);
			states[i][0] = new State(0);
			states[i][0].me = nodes[i];
			states[i][1] = new State(1);
			states[i][1].me = nodes[i];
		}

		for (int i = 0; i < n; i++) {
			temp = reader.readLine().split("[ ]");
			for (int j = 1; j < temp.length; j++) {
				nodes[i].children.add(nodes[Integer.parseInt(temp[j]) - 1]);
			}
		}
		int s = Integer.parseInt(reader.readLine()) - 1;
		solution(states, states[s][1]);
	}

	private static void solution(State[][] states, State root) {

		Stack<State> st = new Stack<State>();
		st.add(root);
		while (!st.isEmpty()) {
			State current = st.pop();
			if (current.parity == 0 && current.me.children.size() == 0) {
				System.out.println("Win");
				Stack<Integer> result = new Stack<Integer>();
				while (current != null) {
					result.push(current.me.id);
					current = current.prev;
				}
				StringBuilder builder = new StringBuilder();
				while (!result.isEmpty()) {
					builder.append((result.pop() + 1) + " ");
				}
				System.out.println(builder.toString());
				return;
			}
			int nextParity = 1 - current.parity;
			List<Node> children = current.me.children;
			for (Node child : children) {
				State childState = states[child.id][nextParity];
				if (childState.prev == null && childState!=root) {
					childState.prev = current;
					st.push(childState);
				}
			}
		}

		if (hasCycle(states.length, root.me)) {
			System.out.println("Draw");
		} else {
			System.out.println("Lose");
		}
	}

	private static boolean hasCycle(int n, Node root) {
		Stack<Node> st = new Stack<Node>();
		st.push(root);

		boolean[] inStack = new boolean[n];
		boolean[] visited = new boolean[n];

		while (!st.isEmpty()) {
			Node current = st.pop();
			visited[current.id] = true;
			inStack[current.id] = true;
			List<Node> children = current.children;
			for (Node child : children) {
				if (!visited[child.id]) {

					st.push(child);
				} else if (inStack[child.id]) {
					return true;
				}
			}
		}
		return false;
	}

	private static class Node {
		List<Node> children;
		int id;

		public Node(int id) {
			this.id = id;
			children = new LinkedList<Node>();
		}

	}

	private static class State {
		Node me;

		// the prev node of a list of nodes include current that makes the number of
		// nodes to be an even number;
		State prev;
		int parity;

		public State(int parity) {
			this.parity = parity;
		}
	}
}
