#include <bits/stdc++.h>
using namespace std;
template <class T1, class T2>
ostream& operator<<(ostream& out, pair<T1, T2>& p) {
  out << p.first << ' ' << p.second;
}
template <class T>
istream& operator>>(istream& in, vector<T>& v) {
  for (auto& x : v) in >> x;
  return in;
}
template <class T>
ostream& operator<<(ostream& out, vector<T>& v) {
  for (auto x : v) out << x << ' ';
  return out;
}
const long double pi = 2 * asin(1);
int n, m, c, x, s;
vector<vector<int> > fward, bward, nxvis;
vector<int> v;
set<int> st;
bool cycle(int i) {
  st.insert(i);
  for (int j = 0; j < fward[i].size(); j++) {
    if (st.find(fward[i][j]) != st.end()) {
      return 1;
    }
    if (cycle(fward[i][j])) return 1;
  }
  st.erase(i);
  return 0;
}
void bdfs(int i) {
  queue<int> q;
  q.push(i);
  while (!q.empty()) {
    i = q.front();
    q.pop();
    for (int j = 0; j < bward[i].size(); j++) {
      if (v[i] != 2) {
        if (v[bward[i][j]] == -1) {
          v[bward[i][j]] = !v[i];
          q.push(bward[i][j]);
        } else if (v[bward[i][j]] == v[i]) {
          v[bward[i][j]] = 2;
          q.push(bward[i][j]);
        }
      } else if (v[bward[i][j]] != 2) {
        v[bward[i][j]] = 2;
        q.push(bward[i][j]);
      }
    }
  }
}
stack<int> S;
bool wdfs(int i, int nx) {
  nxvis[nx][i] = 1;
  S.push(i);
  if (nx == 1 && fward[i].size() == 0) return 1;
  for (int j = 0; j < fward[i].size(); j++) {
    if (!nxvis[!nx][fward[i][j]]) {
      if (wdfs(fward[i][j], !nx)) return 1;
      S.pop();
    }
  }
  return 0;
}
int main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  cin >> n >> m;
  fward.resize(n);
  bward.resize(n);
  v.resize(n, -1);
  nxvis.resize(2, vector<int>(n));
  for (register int i = 0; i < n; i++) {
    cin >> c;
    for (register int j = 0; j < c; j++) {
      cin >> x;
      fward[i].push_back(x - 1);
      bward[x - 1].push_back(i);
    }
  }
  for (register int i = 0; i < n; i++) {
    if (fward[i].empty()) {
      if (v[i] == -1) v[i] = 1;
      if (v[i] == 0) v[i] = 2;
      bdfs(i);
    }
  }
  cin >> s;
  s--;
  if (v[s] == 2 || v[s] == 0) {
    cout << "Win\n";
    wdfs(s, 0);
    vector<int> v;
    while (!S.empty()) {
      v.push_back(S.top());
      S.pop();
    }
    for (int i = v.size() - 1; i > -1; i--) cout << v[i] + 1 << ' ';
    return 0;
  }
  if (cycle(s)) {
    cout << "Draw";
    return 0;
  }
  cout << "Lose";
  return 0;
}
