#include <bits/stdc++.h>
using namespace std;
using uint = unsigned int;
using ll = long long;
using pii = pair<int, int>;
vector<int> adj[100010], stk, sol;
bool vis[100010][2];
bool draw, win;
bool inStk[100010];
void dfs(int v, int len) {
  if (vis[v][len] || win) return;
  vis[v][len] = true;
  if (adj[v].empty() && len == 1) {
    win = true;
    sol = stk;
  }
  for (auto u : adj[v]) {
    if (inStk[u]) draw = true;
    stk.push_back(u);
    inStk[u] = true;
    dfs(u, 1 - len);
    stk.pop_back();
    inStk[u] = false;
  }
}
int main() {
  ios_base::sync_with_stdio(false);
  int i, j, m, n, nr, s;
  cin >> n >> m;
  for (i = 1; i <= n; ++i) {
    cin >> nr;
    adj[i].resize(nr);
    for (j = 0; j < nr; ++j) cin >> adj[i][j];
  }
  cin >> s;
  stk.push_back(s);
  inStk[s] = true;
  dfs(s, 0);
  if (win) {
    cout << "Win\n";
    for (auto val : sol) cout << val << ' ';
    cout << '\n';
  } else if (draw)
    cout << "Draw\n";
  else
    cout << "Lose\n";
  return 0;
}
