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.ArrayDeque;
import java.util.ArrayList;
import java.util.Collections;
import java.util.StringTokenizer;

public class Main {
	private static int N, M, start, end;
	private static int[] ins;
	private static boolean[] loops;
	private static int[][] parent;
	private static ArrayList<ArrayList<Integer>> edges = new ArrayList<ArrayList<Integer>>();
	private static String result = "";

	public static void main(String[] args) throws IOException {
		BufferedReader f = new BufferedReader(new InputStreamReader(System.in));
		StringTokenizer st = new StringTokenizer(f.readLine());
		N = Integer.parseInt(st.nextToken());
		M = Integer.parseInt(st.nextToken());
		for (int i = 0; i < N; i++) {
			edges.add(new ArrayList<Integer>());
		}
		ins = new int[N];
		loops = new boolean[N];
		for (int i = 0; i < N; i++) {
			st = new StringTokenizer(f.readLine());
			int c = Integer.parseInt(st.nextToken());
			for (int k = 0; k < c; k++) {
				int to = Integer.parseInt(st.nextToken()) - 1;
				ins[to]++;
				edges.get(i).add(to);
			}
		}
		start = Integer.parseInt(f.readLine()) - 1;
		ins[start]++;
		int res = bfs();
		if (res == 1) {
			System.out.println("Win");
			System.out.println(trace());
		} else if (res == 0) {
			System.out.println("Draw");
		} else {
			System.out.println("Lose");
		}
	}

	public static String trace() {
		int index = end;
		int parity = 1;
		ArrayList<Integer> list = new ArrayList<Integer>();
		while (true) {
			list.add(index + 1);
			if (index == start && parity == 0) {
				break;
			}
			index = parent[index][parity];
			parity = (parity + 1) % 2;
		}
		Collections.reverse(list);
		StringBuilder sb = new StringBuilder();
		for (int i = 0; i < list.size() - 1; i++) {
			sb.append(list.get(i)).append(" ");
		}
		sb.append(list.get(list.size() - 1));
		return sb.toString();
	}

	public static int bfs() {
		int res = -1;
		boolean[][] visited = new boolean[N][2];
		parent = new int[N][2];
		for (int i = 0; i < N; i++) {
			for (int k = 0; k < 2; k++) {
				parent[i][k] = -1;
			}
		}
		ArrayDeque<node> queue = new ArrayDeque<node>();
		queue.offer(new node(start, 0, -1));
		while (!queue.isEmpty()) {
			node curr = queue.poll();
			int i = curr.vertex;
			int parity = curr.count % 2;
			if (visited[i][parity]) {
				res = 0;
				continue;
			}
			parent[i][parity] = curr.last;
			visited[i][parity] = true;
			if (edges.get(i).size() == 0) {
				if (parity == 1) {
					end = i;
					return 1;
				}
			}
			for (int j : edges.get(i)) {
				queue.offer(new node(j, curr.count + 1, i));
			}
		}
		return res;
	}
}

class node {
	public int vertex, count, last;

	public node(int a, int b, int c) {
		vertex = a;
		count = b;
		last = c;
	}
}