#include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 7;
const long long mod = 1e9 + 7;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
int n, k, s;
int d[N][2];
int res[N][2];
pair<int, int> p[N][2];
bool cycl;
bool used[N];
vector<int> v[N];
bool dfs(int x, int mo) {
  if (used[x]) {
    cycl = true;
  }
  if (d[x][mo]) return res[x][mo];
  d[x][mo] = true;
  used[x] = true;
  for (auto y : v[x]) {
    if (used[y]) {
      cycl = true;
    }
    if (dfs(y, 1 - mo)) {
      p[x][mo] = make_pair(y, 1 - mo);
      res[x][mo] = true;
      return true;
    }
  }
  used[x] = false;
  if (!mo && (int)v[x].size() == 0) {
    res[x][mo] = true;
    return true;
  }
  res[x][mo] = false;
  return false;
}
int main() {
  ios_base::sync_with_stdio(0);
  cin >> n >> k;
  for (int i = 1; i <= n; i++) {
    int l;
    cin >> l;
    for (int j = 0; j < l; j++) {
      int x;
      cin >> x;
      v[i].push_back(x);
    }
  }
  cin >> s;
  if (dfs(s, 1)) {
    cout << "Win\n";
    int f = 1;
    while (s != 0) {
      cout << s << " ";
      auto x = p[s][f];
      s = x.first, f = x.second;
    }
  } else if (cycl)
    cout << "Draw";
  else
    cout << "Lose";
}
