#include <bits/stdc++.h>
using namespace std;
const int N = 1e6 + 41;
const int mod = 1e9 + 7;
const long long INF = 1e16;
const int inf = 1e9;
short u[N];
vector<int> g[N], f[N];
int gm[N][3];
bool is_cycle(int v) {
  if (u[v] == 1) {
    return 1;
  }
  if (u[v] == 2) {
    return 0;
  }
  u[v] = 1;
  for (int to : g[v]) {
    if (is_cycle(to)) {
      return 1;
    }
  }
  u[v] = 2;
  return 0;
}
int main() {
  ios_base::sync_with_stdio(false), cin.tie(NULL);
  ;
  int n, m, k, x, s;
  cin >> n >> m;
  for (int i = 1; i <= n; ++i) {
    cin >> k;
    while (k--) {
      cin >> x;
      g[i].push_back(x);
      f[x].push_back(i);
    }
  }
  cin >> s;
  queue<int> q;
  for (int i = 1; i <= n; ++i) {
    if (g[i].empty()) {
      gm[i][0] = -1;
      q.push(i);
    }
  }
  while (!q.empty()) {
    int v = q.front();
    q.pop();
    for (int p : f[v]) {
      if (gm[v][0] != 0 && gm[p][1] == 0) {
        gm[p][1] = v;
        q.push(p);
      }
      if (gm[v][1] != 0 && gm[p][0] == 0) {
        gm[p][0] = v;
        q.push(p);
      }
    }
  }
  if (gm[s][1]) {
    cout << "Win\n";
    bool win = 1;
    while (~s) {
      cout << s << " ";
      s = gm[s][win];
      win ^= 1;
    }
  } else if (is_cycle(s)) {
    cout << "Draw";
  } else {
    cout << "Lose";
  }
}
