#include <bits/stdc++.h>
using namespace std;
const long long MX = 1e5 + 100, INF = 1e18, INF2 = -1e18, D = 1e9 + 7;
long long n, m;
long long s;
vector<long long> gr[MX][2];
vector<long long> vec;
bool mark[MX][2], st[MX], ed[MX];
bool dfs(long long v, bool c) {
  mark[v][c] = 1;
  if (gr[v][c].size() == 0 && !c) {
    vec.push_back(v + 1);
    return 1;
  }
  for (long long i = 0; i < gr[v][c].size(); i++) {
    long long u = gr[v][c][i];
    if (!mark[u][(c ^ 1)]) {
      if (dfs(u, (c ^ 1))) {
        vec.push_back(v + 1);
        return 1;
      }
    }
  }
  return 0;
}
bool dfs2(long long v) {
  st[v] = 1;
  for (long long i = 0; i < gr[v][0].size(); i++) {
    long long u = gr[v][0][i];
    if (!st[u] && !dfs2(u)) return 0;
    if (!ed[u]) return 0;
  }
  ed[v] = 1;
  return 1;
}
int32_t main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  cin >> n >> m;
  for (long long i = 0; i < n; i++) {
    long long l;
    cin >> l;
    for (long long j = 0; j < l; j++) {
      long long f;
      cin >> f;
      --f;
      gr[i][0].push_back(f);
      gr[i][1].push_back(f);
    }
  }
  cin >> s;
  --s;
  if (!dfs(s, 1)) {
    if (dfs2(s))
      cout << "Lose";
    else
      cout << "Draw";
  } else {
    cout << "Win" << endl;
    for (long long i = vec.size() - 1; i >= 0; i--) cout << vec[i] << ' ';
  }
  return 0;
}
