#include <bits/stdc++.h>
using namespace std;
int n, m, ft[1000002], ed[1000002], nt[1000002], L, vs[1000002], S;
void add(int a, int b) {
  nt[++L] = ft[a];
  ft[a] = L;
  ed[L] = b;
}
int f[1000002][2], is[1000002], ntt[1000002][2], ls[1000002], tot, fl;
void dfs(int x, int o) {
  f[x][o] = 1;
  if (!is[x] && o == 1) {
    fl = 1;
    return;
  }
  for (int i = ft[x]; i; i = nt[i]) {
    if (!f[ed[i]][o ^ 1]) ntt[x][o] = ed[i], dfs(ed[i], o ^ 1);
    if (fl) return;
  }
}
void isr(int x) {
  vs[x] = 1;
  for (int i = ft[x]; i; i = nt[i])
    if (vs[ed[i]] == 1)
      fl = 1;
    else if (!vs[ed[i]])
      isr(ed[i]);
  vs[x] = 2;
}
int main() {
  cin >> n >> m;
  for (int i = 1; i <= n; i++) {
    int o, x;
    scanf("%d", &o);
    is[i] = o;
    for (; o--;) scanf("%d", &x), add(i, x);
  }
  cin >> S;
  dfs(S, 0);
  if (fl) {
    puts("Win");
    for (int i = S, v = 0; i; i = ntt[i][v], v ^= 1) cout << i << ' ';
    return puts(""), 0;
  }
  puts((isr(S), fl) ? "Draw" : "Lose");
  return 0;
}
