#include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 100;
int n, h[N], cnt, m, vis[N][2], st, len[N], f = 0, top;
int chu[N], dfn[N], low[N], tim, inq[N], scc, Stack[N], t[N], mx;
struct Edge {
  int to, next;
} e[N << 1];
void add(int u, int v) {
  e[++cnt] = (Edge){v, h[u]};
  h[u] = cnt;
}
void Tarjan(int u) {
  dfn[u] = low[u] = ++tim;
  Stack[++top] = u;
  inq[u] = 1;
  for (int i = h[u]; i; i = e[i].next) {
    int v = e[i].to;
    if (!dfn[v]) {
      Tarjan(v);
      low[u] = min(low[u], low[v]);
    } else {
      if (inq[v]) low[u] = min(low[u], dfn[v]);
    }
  }
  if (low[u] == dfn[u]) {
    ++scc;
    while (Stack[top] ^ u) {
      inq[Stack[top]] = 0;
      t[scc]++;
      --top;
    }
    inq[u] = 0;
    --top;
    t[scc]++;
    mx = max(mx, t[scc]);
  }
}
void dfs(int u, int mk) {
  for (int i = h[u]; i; i = e[i].next) {
    int v = e[i].to;
    if (vis[v][mk ^ 1]) continue;
    vis[v][mk ^ 1] = 1;
    len[++top] = v;
    if (!mk && !chu[v]) {
      printf("Win\n");
      for (int i = 0; i <= top; i++) printf("%d ", len[i]);
      exit(0);
    }
    dfs(v, mk ^ 1);
    --top;
  }
}
int gi() {
  int x = 0, t = 1;
  char ch = getchar();
  while (ch != '-' && (ch < '0' || ch > '9')) ch = getchar();
  if (ch == '-') t = -1, ch = getchar();
  while (ch >= '0' && ch <= '9') x = x * 10 + ch - 48, ch = getchar();
  return x * t;
}
int main() {
  n = gi();
  m = gi();
  for (int i = 1; i <= n; i++) {
    chu[i] = gi();
    for (int j = 1; j <= chu[i]; j++) add(i, gi());
  }
  len[0] = gi();
  dfs(len[0], 0);
  top = 0;
  Tarjan(len[0]);
  if (mx > 1) {
    printf("Draw\n");
    return 0;
  }
  printf("Lose\n");
  return 0;
}
