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

/* package whatever; // don't place package name! */

import java.util.*;
import java.lang.*;
import java.io.*;

/* Name of the class has to be "Main" only if the class is public. */
public class Main
{
	public static void main (String[] args) throws java.lang.Exception
	{
		Scanner scan=new Scanner(System.in);
		int n=scan.nextInt();
		int m=scan.nextInt();
		Map gr=new HashMap();
		int[] leaf=new int[n+1];
		int nl=0;
		for(int i=1;i<=n;i++){
			int ci=scan.nextInt();
			int[] conn=new int[ci];
			for(int j=0;j<ci;j++){
				conn[j]=scan.nextInt();
			}
			gr.put(i,conn);
			if(ci==0){
				leaf[i]=1;
				nl++;
			}
			else{
				leaf[i]=0;
			}
		}
		int s=scan.nextInt();
		int[] pr=new int[n+1];
		
		int[] odd=new int[n+1];
		int[] even=new int[n+1];
		for(int i=1;i<=n;i++){
			pr[i]=-1;
			odd[i]=0;
			even[i]=0;
		}
		Queue q=new LinkedList();
		Queue dq=new LinkedList();
		q.add(s);
		dq.add(0);
		even[s]=1;
		int canwin=0;
		int end=-1;
		while(q.peek()!=null){
			int v=(int)q.poll();
			int d=(int)dq.poll();
			if(leaf[v]==1 && d%2==1){
				canwin=1;
				end=v;
				break;
			}
			int[] nei=(int[])gr.get(v);
			int ci=nei.length;
			for(int i=0;i<ci;i++){
				int t=nei[i];
				if((d%2==0 && odd[t]==0) || (d%2==1 && even[t]==0)){
					q.add(t);
					dq.add(d+1);
					pr[t]=v;
					if(d%2==0){
						odd[t]=1;
					}
					else{
						even[t]=1;
					}
				}
			}
		}
		if(canwin==1){
			System.out.println("Win");
			int[] path=new int[500001];
			int tot=0;
			int cur=end;
			while(cur!=-1){
				path[tot]=cur;
				cur=pr[cur];
				tot++;
			}
			//path[tot++]=s;
			for(int i=tot-1;i>=0;i--){
				if(i!=tot-1){
					System.out.print(" ");
				}
				System.out.print(path[i]);
			}
			System.out.println("");
		}
		else{
			for(int i=1;i<=n;i++){pr[i]=-1;}
			q.clear();
			//Queue dq=new LinkedList();
			q.add(s);
			//dq.add(0);
			int candraw=0;
			int cyclelen=-1;
			int start=-1;
			end=-1;
			pr[s]=0;
			while(q.peek()!=null){
				int v=(int)q.poll();
				if(candraw==1){break;}
				int[] nei=(int[])gr.get(v);
				int ci=nei.length;
				for(int i=0;i<ci;i++){
					int t=nei[i];
					if(pr[t]==-1){
						q.add(t);
						//dq.add(d+1);
						pr[t]=v;
					}
					else{
						start=t;
						end=v;
						candraw=1;
						break;
					}
					
				}
			}
			if(candraw==1){
				System.out.println("Draw");
			}
			else{
				System.out.println("Lose");
			}
		}
		
	}
}