#include <bits/stdc++.h>
using namespace std;
const int MAX = 1e5 + 5;
int n, m, a, x, k, ir[MAX][3];
vector<int> g[MAX], v[MAX];
int dp[MAX][3];
queue<int> Q;
vector<int> s;
int T[MAX], low[MAX], L;
int y, cn, cc;
stack<int> S;
bool mk[MAX], mm[MAX], mar[MAX];
void SCC(int np) {
  T[np] = low[np] = ++L;
  int l = v[np].size();
  S.push(np);
  for (int i = 0; i < l; i++) {
    int nh = v[np][i];
    if (!T[nh]) {
      SCC(nh);
      low[np] = min(low[nh], low[np]);
    } else if (!mk[nh])
      low[np] = min(T[nh], low[np]);
  }
  if (low[np] == T[np]) {
    bool mar = false;
    while (S.top() != np) {
      mk[S.top()] = true;
      mm[S.top()] = true;
      S.pop();
      mar = true;
    }
    if (mar) mm[S.top()] = true;
    mk[S.top()] = true;
    S.pop();
  }
}
int main() {
  scanf("%d%d", &n, &m);
  for (int i = 1; i <= n; i++) {
    scanf("%d", &a);
    dp[i][0] = dp[i][1] = -1;
    ir[i][0] = ir[i][1] = -1;
    if (!a) {
      Q.push(i);
      dp[i][0] = true;
    }
    while (a--) {
      scanf("%d", &x);
      g[x].push_back(i);
      v[i].push_back(x);
    }
  }
  scanf("%d", &k);
  while (!Q.empty()) {
    int nd = Q.front();
    Q.pop();
    for (int v : g[nd]) {
      if (dp[v][0] == -1 && dp[nd][1] == 1) {
        dp[v][0] = 1;
        ir[v][0] = nd;
        Q.push(v);
      }
      if (dp[v][1] == -1 && dp[nd][0] == 1) {
        dp[v][1] = 1;
        ir[v][1] = nd;
        Q.push(v);
      }
    }
  }
  for (int i = 1; i <= n; i++) {
    if (!mk[i]) SCC(i);
  }
  for (int i = 1; i <= n; i++)
    if (mm[i]) Q.push(i);
  while (!Q.empty()) {
    int nd = Q.front();
    mar[nd] = true;
    Q.pop();
    for (int v : g[nd]) {
      if (!mm[v] && !mar[v]) {
        mm[v] = true;
        mar[v] = true;
        Q.push(v);
      }
    }
  }
  if (dp[k][1] == -1) {
    if (mm[k])
      printf("Draw\n");
    else
      printf("Lose\n");
  } else {
    printf("Win\n");
    while (1) {
      s.push_back(k);
      k = ir[k][1];
      if (k == -1) break;
      s.push_back(k);
      k = ir[k][0];
      if (k == -1) break;
    }
    printf("%d", s[0]);
    for (int i = 1; i < (int)s.size(); i++) printf(" %d", s[i]);
    printf("\n");
  }
  return 0;
}
