#include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 5;
vector<int> g[N], vc;
int vis[N][2], pre[N][2], vs[N];
void dfs(int o, int u, int d) {
  if (vis[u][d] == 1) return;
  vis[u][d] = 1;
  pre[u][d] = o;
  for (int i = 0; i < g[u].size(); i++) {
    dfs(u, g[u][i], d ^ 1);
  }
}
bool hasloop(int u) {
  vs[u] = 1;
  bool f = false;
  for (int i = 0; i < g[u].size(); i++) {
    if (vs[g[u][i]] == 1)
      f = true;
    else if (vs[g[u][i]] == 0)
      f = hasloop(g[u][i]);
    if (f) return true;
  }
  vs[u] = 2;
  return false;
}
int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  int n, m, t, u, s;
  cin >> n >> m;
  for (int i = 1; i <= n; i++) {
    cin >> t;
    while (t--) {
      cin >> u;
      g[i].push_back(u);
    }
  }
  cin >> s;
  dfs(0, s, 0);
  for (int i = 1; i <= n; i++) {
    if (vis[i][1] && g[i].size() == 0) {
      int u = i, t = 1;
      vc.push_back(u);
      while (pre[u][t] != 0) {
        vc.push_back(pre[u][t]);
        u = pre[u][t];
        t ^= 1;
      }
      cout << "Win" << endl;
      for (int j = vc.size() - 1; j >= 0; j--) cout << vc[j] << ' ';
      cout << endl;
      return 0;
    }
  }
  if (hasloop(s))
    cout << "Draw" << endl;
  else
    cout << "Lose" << endl;
  return 0;
}
