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.*;
import java.util.*;

public class D implements Runnable{
	public static void main (String[] args) {new Thread(null, new D(), "_cf", 1 << 28).start();}

	int n, m;
	ArrayList<Integer>[] di;
	int[] in, ot;
	int[][] vis;
	int OPEN = 100;

	public void run() {
		FastScanner fs = new FastScanner();
		PrintWriter out = new PrintWriter(System.out);
		System.err.println("Go!");

		n = fs.nextInt();
		m = fs.nextInt();

		di = new ArrayList[n];
		in = new int[n];
		ot = new int[n];
		for(int i = 0; i < n; i++) di[i] = new ArrayList<>();
		for(int i = 0; i < n; i++) {
			int c = fs.nextInt();
			for(int j = 0; j < c; j++) {
				int u = fs.nextInt() - 1;
				di[i].add(u);
				ot[i]++;
				in[u]++;
			}
		}

		int s = fs.nextInt() - 1;
		vis = new int[2][n];
		for(int i = 0; i <2; i++) Arrays.fill(vis[i], -1);
		int win = dfs(s, 1);
		if(win == 3) {
			System.out.println("Lose");
		}
		else if(win == 2 || win == 0) {
			System.out.println("Draw");
		}
		else {
			out.println("Win");
			int[] wins = new int[1000001];
			boolean[][] V = new boolean[2][n];
			int ptr = 0, clen = 0;
			int at = s;
			while(true) {
				clen++;
				V[clen&1][at] = true;
				wins[ptr++] = at;
				if(ot[at] == 0) break;
				for(Integer v : di[at]) {
					int nlen = (clen + 1) & 1;
					if(nlen == 0 ) {
						if(vis[nlen][v] == 3 && !V[nlen][v]) {
							at = v;
							V[nlen][v] = true;
							break;
						}
					}
					else {
						if(vis[nlen][v] == 1 && !V[nlen][v]) {
							at = v;
							V[nlen][v] = true;
							break;
						}
					}
				}
			}
			for(int i = 0; i < ptr; i++) {
				out.print(wins[i]+1 + " ");
			}
		}

		out.close();
	}

	int dfs(int u, int len) {
//		System.out.println((u+1) + " " + len + " " + ot[u]);
		if(ot[u] == 0) {
			if(len%2==0) return vis[len&1][u] = 3;
			return vis[len&1][u] = 3;
		}

		vis[len&1][u] = OPEN;
		boolean draw = false;
		boolean win = false;
		boolean forceLose = false;
		int nlen = (len + 1) & 1;
		for(Integer v : di[u]) {
			if(vis[(len+1)&1][v] == OPEN) {
				draw = true;
				continue;
			}

			int state;
			if(vis[nlen][v] != -1) {
				state = vis[nlen][v];
			}
			else {
				state = dfs(v, len + 1);
			}

//			System.out.printf("At %d Len %d going to %d Len %d gets %d\n", u+1, len, v+1, len+1, state);

			if(len % 2 == 1) {
				//play as petya
				if(state == 3) {
					win = true;
				}
				else if(state == 2) {
					draw = true;
				}
			}
			else {
				//play as vasya make unoptimal move
				if(state == 1) {
					forceLose = true;
				}
				else if(state == 2) draw = true;
				else {
				}
			}


		}

		if(len%2 == 1) {
			if(win) vis[len&1][u] = 1;
			else if(draw) vis[len&1][u] = 2;
			else vis[len&1][u] = 3;
		}
		else {
			if(forceLose) vis[len&1][u] = 3;
			else if(draw) vis[len&1][u] = 2;
			else vis[len&1][u] = 1;
		}
		return vis[len&1][u];
	}

	void sort (int[] a) {
		int n = a.length;
		for(int i = 0; i < 50; i++) {
			Random r = new Random();
			int x = r.nextInt(n), y = r.nextInt(n);
			int temp = a[x];
			a[x] = a[y];
			a[y] = temp;
		}
		Arrays.sort(a);
	}

	class FastScanner {
		BufferedReader br;
		StringTokenizer st;
		public FastScanner() {
			try	{
				br = new BufferedReader(new InputStreamReader(System.in));
				//                br = new BufferedReader(new FileReader("testdata.out"));
				st = new StringTokenizer("");
			} catch (Exception e){e.printStackTrace();}
		}
		public String next() {
			if (st.hasMoreTokens())	return st.nextToken();
			try {st = new StringTokenizer(br.readLine());}
			catch (Exception e) {e.printStackTrace();}
			return st.nextToken();
		}
		public int nextInt() {return Integer.parseInt(next());}
		public long nextLong() {return Long.parseLong(next());}
		public double nextDouble() {return Double.parseDouble(next());}

		public String nextLine() {
			String line = "";
			try {line = br.readLine();}
			catch (Exception e) {e.printStackTrace();}
			return line;
		}
		public Integer[] nextIntegerArray(int n) {
			Integer[] a = new Integer[n];
			for(int i = 0; i < n; i++) a[i] = nextInt();
			return a;
		}
		public int[] nextIntArray(int n) {
			int[] a = new int[n];
			for(int i = 0; i < n; i++) a[i] = nextInt();
			return a;
		}
		public char[] nextCharArray() {return nextLine().toCharArray();}
	}

}