#include <bits/stdc++.h>
using namespace std;
int n, ans, m, s, d[2][100010];
int par[2][100010];
bool was[2][100010], ok, lose[100010];
vector<vector<int> > gr;
vector<int> vi;
void bfs() {
  queue<pair<int, int> > q;
  q.push({s, 0});
  for (int i = 0; i < n; ++i) {
    d[0][s] = d[1][s] = 1e9;
  }
  d[0][s] = 0;
  was[0][s] = 1;
  par[0][s] = -1;
  while (!q.empty()) {
    int x = q.front().first;
    int mod = q.front().second;
    q.pop();
    for (auto i : gr[x]) {
      int dist = d[mod][x] + 1;
      if (!was[dist % 2][i]) {
        was[dist % 2][i] = 1;
        q.push({i, dist % 2});
        d[dist % 2][i] = dist;
        par[dist % 2][i] = x;
      }
    }
  }
}
int was1[100010];
bool dfs(int x) {
  was1[x] = 1;
  for (auto i : gr[x]) {
    if (was1[i] == 1) {
      return 1;
    }
    if (was1[i] == 0 and dfs(i)) {
      return 1;
    }
  }
  was1[x] = 2;
  return 0;
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(nullptr);
  cin >> n >> m;
  gr.resize(n, vi);
  for (int i = 0; i < n; ++i) {
    int x;
    cin >> x;
    if (!x) {
      lose[i] = 1;
    }
    for (int j = 0; j < x; ++j) {
      int v;
      cin >> v;
      gr[i].push_back(v - 1);
    }
  }
  cin >> s;
  --s;
  was1[s] = 1;
  ok = dfs(s);
  bfs();
  for (int i = 0; i < n; ++i) {
    if (lose[i] and was[1][i]) {
      cout << "Win\n";
      int x = i;
      int mod = 1;
      stack<int> st;
      while (x != -1) {
        st.push(x);
        x = par[mod][x];
        mod++;
        mod %= 2;
      }
      while (!st.empty()) {
        cout << st.top() + 1 << " ";
        st.pop();
      }
      return 0;
    }
  }
  if (ok) {
    cout << "Draw\n";
    return 0;
  }
  cout << "Lose\n";
}
