#include <bits/stdc++.h>
using namespace std;
long long n, m, s, par[100005][2], ck[100005];
vector<long long> ke[100005];
bool cyc, ok[100005][2];
void dfs(long long u, long long t) {
  ok[u][t] = true;
  for (auto v : ke[u]) {
    if (ok[v][t ^ 1]) continue;
    par[v][t ^ 1] = u;
    dfs(v, t ^ 1);
  }
}
void dfs(long long u) {
  ck[u] = 1;
  for (auto v : ke[u]) {
    if (ck[v] == 1) {
      cyc = true;
    } else if (ck[v] == 0)
      dfs(v);
  }
  ck[u] = 2;
}
void Solve() {
  cin >> n >> m;
  for (long long i = 1, _b = n; i <= _b; i++) {
    long long siz;
    cin >> siz;
    while (siz--) {
      long long u;
      cin >> u;
      ke[i].push_back(u);
    }
  }
  cin >> s;
  dfs(s, 0);
  for (long long i = 1, _b = n; i <= _b; i++) {
    if (ke[i].size() == 0 && ok[i][1]) {
      cout << "Win\n";
      stack<long long> res;
      long long cur = i, vt = 1;
      do {
        res.push(cur);
        cur = par[cur][vt];
        vt ^= 1;
      } while (cur != 0);
      while (res.size()) {
        cout << res.top() << " ";
        res.pop();
      }
      return;
    }
  }
  dfs(s);
  if (cyc) {
    cout << "Draw";
    return;
  }
  cout << "Lose";
}
int main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  int Test_numbers = 1;
  while (Test_numbers--) Solve();
  return 0;
}
