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 com.company;

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

public class Main {
    public static void main(String[] args) throws IOException {
        MyScanner sc = new MyScanner(System.in);
        PrintWriter pw = new PrintWriter(System.out);
        Task.solve(sc, pw);
        pw.close();
    }

    public static class Task {
        static class Node {
            int idx; int state; // -1, unvisit, 0 win, 1 tie, 2 lose, -2 parent
            int partity;
            int prev;
            List<Integer> to;
            Node(int id, int p){
                idx = id;
                state = -1;
                partity = p;
                to = new ArrayList<>();
                prev = -1;
            }
        }
        static int n, m;
        static Node[] nodes;
        static int s;
        public static void solve(MyScanner sc, PrintWriter pw) throws IOException {
            n = sc.nextInt(); m = sc.nextInt();
            nodes = new Node[n*2];
            for (int i = 0; i < n; i++) {
                int cnt = sc.nextInt();
                nodes[i*2] = new Node(i * 2, 0);
                nodes[i*2 + 1] = new Node(i * 2 + 1, 1);
                for (int j = 0; j < cnt; j++) {
                    int t = sc.nextInt(); t--;
                    nodes[i*2].to.add(t*2 + 1);
                    nodes[i*2 + 1].to.add(t*2);
                }
            }
            s = sc.nextInt() - 1;
            int res = (dfs(s * 2));
            if (res == 1) {
                pw.println("Draw");
            } else if (res == 2) {
                pw.println("Lose");
            } else {
                pw.println("Win");
                int p = s * 2;
                while (p != -1){
                    pw.print(((p/2)+1) + " ");
                    p = nodes[p].prev;
                }
            }
        }
        public static int dfs(int v){
            if (nodes[v].state != -1) {
                return nodes[v].state;
            }
            nodes[v].state = -2;
            int cntlose = 0, cntwin = 0,cnttie = 0, loopback = 0;
            for (int i = 0; i < nodes[v].to.size(); i++) {
                int k = dfs(nodes[v].to.get(i));
                if (k == 0){
                    nodes[v].prev = nodes[v].to.get(i);
                    cntwin++;
                } else if(k == 1){
                    cnttie++;
                } else if(k == 2) {
                    cntlose++;
                } else {
                    loopback++;
                }
            }
            int ms = 0;
            if (nodes[v].partity == 1) {
                if (nodes[v].to.size() == 0) {
                    ms = 0;
                } else if (cntwin != 0) {
                    ms = 0;
                } else if (cnttie != 0) {
                    ms = 1;
                } else if (loopback != 0){
                    ms = 1;
                } else if (cntlose != 0) {
                    ms = 2;
                } else {
                    ms = 1;
                }
            } else {
                if (nodes[v].to.size() == 0) {
                    ms = 2;
                } else if (cntwin != 0){
                    ms = 0;
                } else if (cnttie != 0) {
                    ms = 1;
                } else if (loopback != 0){
                    ms = 1;
                } else if (cntlose != 0) {
                    ms = 2;
                } else {
                    ms = 1;
                }
            }
            return nodes[v].state = ms;
        }


    }


    static class MyScanner {
        StringTokenizer st;
        BufferedReader br;

        public MyScanner(InputStream s){  br = new BufferedReader(new InputStreamReader(s));}

        public MyScanner(FileReader s) throws FileNotFoundException {br = new BufferedReader(s);}

        public String next() throws IOException
        {
            while (st == null || !st.hasMoreTokens())
                st = new StringTokenizer(br.readLine());
            return st.nextToken();
        }

        public int nextInt() throws IOException {return Integer.parseInt(next());}

        public long nextLong() throws IOException {return Long.parseLong(next());}

        public String nextLine() throws IOException {return br.readLine();}

        public double nextDouble() throws IOException { return Double.parseDouble(next()); }

        public boolean ready() throws IOException {return br.ready();}
    }
}
