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

/* Rajkin Hossain */

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

public class R467PDD2 {
	
	public static FastInput input;
	//public static Scanner input;
	public static FastOutput output;
	
	private static Graph graph;
	private static int nodes, edges;
	 
	public static void main(String [] args) throws IOException {
		input = new FastInput(System.in);
		//input = new Scanner(new File(System.getProperty("user.home") + File.separator + "Desktop" + File.separator + "input.txt"));
		output = new FastOutput();
		while(input.hasNext()){
			nodes = input.nextInt();
			edges = input.nextInt();
			
			graph = new Graph(nodes);
			addEdgesFromInput();
			graph.bfs(input.nextInt() - 1, 1);
			if (graph.winPossible) {
				output.println("Win");
				pathPrint();
			}
			else if (graph.drawPossible) {
				output.println("Draw");
			} else {
				output.println("Lose");
			}
			
		}
		output.flush();
	}
	
	private static void pathPrint() {
		output.print(graph.path.get(graph.path.size() - 1) + 1);
		for(int i = graph.path.size() - 2; i >= 0; i--) {
			output.print(" "+(graph.path.get(i) + 1));
		}
	}
	
	private static void addEdgesFromInput() {
		for(int i = 0; i < nodes; i++) {
			int nextNodes = input.nextInt();
			for (int counter = 0; counter < nextNodes; counter++) {
				int nextNode = input.nextInt();
				graph.addEdgeSingleDirectional(i, nextNode - 1);
			}
		}
	}
	
	
	/* MARK: Graph domain class */
	
    public static class Graph {
        public int nodes;
        public ArrayList<Integer> [] neighbors;
        public int [] parent;
        public ArrayList<Integer> path;
        public ArrayDeque<Pair> queue;
        public boolean [][] marked;
        public boolean drawPossible, winPossible;
         
        @SuppressWarnings("unchecked")
		public Graph(int nodes) {
            this.nodes = nodes;
            neighbors = new ArrayList[nodes];
            path = new ArrayList<Integer>();
            queue = new ArrayDeque<Pair>();
            marked = new boolean[nodes][2];
            parent = new int[nodes];
            drawPossible = false;
            winPossible = false;
            for(int i = 0; i<nodes; i++){
            		neighbors[i] = new ArrayList<>();
            		parent[i] = -1;
            }
        }
        
        public void addEdgeSingleDirectional(int u, int v) {
        		neighbors[u].add(v);
        }
        
        public void addEdgeBiDirectional(int u, int v) {
    			neighbors[u].add(v);
    			neighbors[v].add(u);
        }
        
        public void getPath(int node) {
        		while (node != -1) {
        			path.add(node);
        			node = parent[node];
        		}
        }
        
        public void bfs(int currentNode, int nodesFromRoot) {
        		queue.add(new Pair(currentNode, nodesFromRoot));
        		while(!queue.isEmpty()) {
        			currentNode = queue.peek().node;
        			nodesFromRoot = queue.poll().nodesFromRoot;
            		if (win(currentNode, nodesFromRoot)) {
            			winPossible = true;
            			getPath(currentNode);
            			
            			return;
            		}
            		for (int i = 0; i < neighbors[currentNode].size(); i++) {
            			int neighborNode = neighbors[currentNode].get(i);
            			int isOdd = (nodesFromRoot + 1) % 2 == 0 ? 0 : 1;
            			if (!marked[neighborNode][isOdd]) {
            				marked[neighborNode][isOdd] = true;
            				parent[neighborNode] = currentNode;
            				queue.add(new Pair(neighborNode, nodesFromRoot + 1));
            			}
            			if (!marked[neighborNode][isOdd]) {
            				marked[neighborNode][isOdd] = true;
            				parent[neighborNode] = currentNode;
            				queue.add(new Pair(neighborNode, nodesFromRoot + 1));
            			}
            			
            			if(!marked[neighborNode][0] || !marked[neighborNode][1]) {
            				drawPossible = true;
            			}
            		}
        		}
        }
        
        public boolean win(int node, int nodesFromRoot) {
        		return (neighbors[node].size() == 0 && nodesFromRoot % 2 == 0) ? true : false;
        }
    }
    
    
    /* MARK: Pair class */
    
    public static class Pair {
    		public int node, nodesFromRoot;
    		public Pair(int node, int nodesFromRoot) {
    			this.node = node;
    			this.nodesFromRoot = nodesFromRoot;
    		}
    }
    
    
	/* MARK: FastInput and FastOutput */

	public static class FastInput {
	    BufferedReader reader;
	    StringTokenizer tokenizer;

	    public FastInput(InputStream stream){
	        reader = new BufferedReader(new InputStreamReader(stream));
	    }

	    public String next() {
	        return nextToken();
	    }

	    public boolean hasNext(){
	    	try {
				return reader.ready();
			} catch (IOException e) {
				// TODO Auto-generated catch block
				e.printStackTrace();
			}
			return false;
	    }

	    public String nextToken() {
	        while (tokenizer == null || !tokenizer.hasMoreTokens()) {
	            String line = null;
	            try {
	                line = reader.readLine();
	            } catch (IOException e) {
	                throw new RuntimeException(e);
	            }
	            if (line == null) {
	                return null;
	            }
	            tokenizer = new StringTokenizer(line);
	        }
	        return tokenizer.nextToken();
	    }

	    public int nextInt() {
	        return Integer.parseInt(nextToken());
	    }
	    
	    public long nextLong() {
	        return Long.valueOf(nextToken());
	    }
	}

    public static class FastOutput extends PrintWriter {
    		FastOutput() { super(new BufferedOutputStream(System.out)); }
    }
}