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.io.PrintWriter;
import java.util.ArrayDeque;
import java.util.Arrays;
import java.util.Queue;
import java.util.StringTokenizer;

/**
 * @author Don Li
 */
public class SleepyGame {
    
    int N = (int) 1e5 + 10;
    
    int n, m, s;
    int[][] G = new int[N][];
    int[][] R = new int[N][];
    
    int[] sta = new int[N];
    boolean[] canWin = new boolean[N], canLose = new boolean[N], canLoop = new boolean[N];
    int[] winNext = new int[N], loseNext = new int[N];
    
    void solve() {
        n = in.nextInt(); m = in.nextInt();
        int[] sz = new int[n];
        for (int i = 0; i < n; i++) {
            G[i] = new int[in.nextInt()];
            for (int j = 0; j < G[i].length; j++) {
                int v = in.nextInt() - 1;
                G[i][j] = v;
                sz[v]++;
            }
        }
        s = in.nextInt() - 1;
        
        for (int i = 0; i < n; i++) R[i] = new int[sz[i]];
        for (int u = 0; u < n; u++) {
            for (int v : G[u]) R[v][--sz[v]] = u;
        }
        
        Arrays.fill(winNext, -1);
        Arrays.fill(loseNext, -1);
        
        boolean[] inq = new boolean[N << 1];
        Queue<Integer> qu = new ArrayDeque<>(N << 1);
        for (int u = 0; u < n; u++) {
            if (G[u].length == 0) {
                canLose[u] = true;
                qu.offer(u);
                inq[u] = true;
            }
        }
        while (!qu.isEmpty()) {
            int u = qu.poll();
            if (u < N) {
                for (int v : R[u]) {
                    if (!canWin[v]) {
                        canWin[v] = true;
                        winNext[v] = u;
                    }
                    if (!inq[N + v]) {
                        qu.offer(N + v);
                        inq[N + v] = true;
                    }
                }
            } else {
                u -= N;
                for (int v : R[u]) {
                    if (!canLose[v]) {
                        canLose[v] = true;
                        loseNext[v] = u;
                    }
                    if (!inq[v]) {
                        qu.offer(v);
                        inq[v] = true;
                    }
                }
            }
        }
        
        if (canWin[s]) {
            out.println("Win");
            int dir = 1;
            do {
                out.print(s + 1 + " ");
                if (dir > 0) s = winNext[s];
                else s = loseNext[s];
                dir ^= 1;
            } while (s >= 0);
        } else {
            dfs(s);
            if (canLoop[s]) out.println("Draw");
            else out.println("Lose");
        }
    }
    
    void dfs(int u) {
        sta[u] = 1;
        for (int v : G[u]) {
            if (sta[v] == 0) {
                dfs(v);
            } else if (sta[v] == 1) {
                canLoop[u] = true;
            }
            if (canLoop[v]) canLoop[u] = true;
        }
        sta[u] = 2;
    }
    
    public static void main(String[] args) {
        in = new FastScanner(new BufferedReader(new InputStreamReader(System.in)));
        out = new PrintWriter(System.out);
        new SleepyGame().solve();
        out.close();
    }
    
    static FastScanner in;
    static PrintWriter out;
    
    static class FastScanner {
        BufferedReader in;
        StringTokenizer st;
        
        public FastScanner(BufferedReader in) {
            this.in = in;
        }
        
        public String nextToken() {
            while (st == null || !st.hasMoreTokens()) {
                try {
                    st = new StringTokenizer(in.readLine());
                } catch (IOException e) {
                    e.printStackTrace();
                }
            }
            return st.nextToken();
        }
        
        public int nextInt() {
            return Integer.parseInt(nextToken());
        }
        
        public long nextLong() {
            return Long.parseLong(nextToken());
        }
        
        public double nextDouble() {
            return Double.parseDouble(nextToken());
        }
    }
}
