#include <bits/stdc++.h>
using namespace std;
inline int read() {
  int k = 0, f = 1;
  char ch = getchar();
  while (ch < '0' || ch > '9') {
    if (ch == '-') f = -1;
    ch = getchar();
  }
  while (ch >= '0' && ch <= '9') {
    k = k * 10 + ch - '0';
    ch = getchar();
  }
  return k * f;
}
inline void write(int x) {
  if (x < 0) putchar('-'), x = -x;
  if (x > 9) write(x / 10);
  putchar(x % 10 + '0');
}
inline void writeln(int x) {
  write(x);
  puts("");
}
int f[100010][2], n, m;
bool b[100010];
int nedge = 0, p[200010], nex[200010], head[200010];
inline void addedge(int a, int b) {
  p[++nedge] = b;
  nex[nedge] = head[a];
  head[a] = nedge;
}
bool flag = 0;
bool vis[100010];
inline void dfs(int x, int v) {
  vis[x] = 1;
  for (int k = head[x]; k; k = nex[k]) {
    if (vis[p[k]]) flag = 1;
    if (f[p[k]][v ^ 1] == -1) {
      f[p[k]][v ^ 1] = x;
      dfs(p[k], v ^ 1);
    }
  }
  vis[x] = 0;
}
inline void dfss(int x, int v) {
  if (!x) return;
  dfss(f[x][v], v ^ 1);
  write(x);
  putchar(' ');
}
int main() {
  memset(f, -1, sizeof f);
  n = read();
  m = read();
  for (int i = 1; i <= n; i++) {
    int mm = read();
    for (int j = 1; j <= mm; j++) {
      int x = read();
      addedge(i, x);
    }
    if (!mm) b[i] = 1;
  }
  int rt = read();
  f[rt][0] = 0;
  dfs(rt, 0);
  for (int i = 1; i <= n; i++)
    if (b[i] && f[i][1] > 0) {
      puts("Win");
      dfss(i, 1);
      return 0;
    }
  if (flag)
    puts("Draw");
  else
    puts("Lose");
  return 0;
}
