#include <bits/stdc++.h>
using namespace std;
int n, m, deg[100005], to[100005][2], cnt[100005][2], s, ta;
vector<int> v[100005], q;
void go(int a, int b) {
  for (int i = 0; i < v[a].size(); i++) {
    cnt[v[a][i]][b]++;
    if (to[a][b ^ 1]) {
      if (!to[v[a][i]][b]) {
        to[v[a][i]][b] = a;
        go(v[a][i], b ^ 1);
      }
    } else if (cnt[v[a][i]][b] == deg[v[a][i]])
      go(v[a][i], b ^ 1);
  }
}
int main() {
  scanf("%d%d", &n, &m);
  for (int i = 1; i <= n; i++) {
    scanf("%d", deg + i);
    if (deg[i])
      for (int j = 0; j < deg[i]; j++) {
        scanf("%d", &ta);
        v[ta].push_back(i);
      }
    else
      q.push_back(i);
  }
  for (int i = 0; i < q.size(); i++) {
    to[q[i]][0] = -1;
    go(q[i], 1);
    go(q[i], 0);
  }
  scanf("%d", &s);
  if (to[s][1]) {
    printf("Win\n%d", s);
    s = to[s][ta = 1];
    while (s != -1) {
      printf(" %d", s);
      s = to[s][ta ^= 1];
    }
    printf("\n");
  } else if (cnt[s][1] == deg[s])
    printf("Lose\n");
  else
    printf("Draw\n");
  return 0;
}
