#include <bits/stdc++.h>
using namespace std;
const int M = 1e9 + 7;
const int N = 1e5 + 10;
int n, m;
vector<vector<int> > g;
int vis[N];
bool used[N][2];
vector<int> path, tmp;
int outDeg[N];
void MaxPath(int u, int turn) {
  used[u][turn] = 1;
  tmp.push_back(u);
  if ((tmp.size() % 2 == 0) && outDeg[u] == 0) path = tmp;
  for (int v : g[u]) {
    if (!used[v][1 - turn]) {
      MaxPath(v, 1 - turn);
      tmp.pop_back();
    }
  }
}
bool findCycle(int u) {
  vis[u] = 1;
  for (int v : g[u]) {
    if (!vis[v]) {
      vis[v] = 1;
      if (findCycle(v)) return 1;
    } else if (vis[v] == 1)
      return 1;
  }
  vis[u] = 2;
  return 0;
}
void solve() {
  cin >> n >> m;
  g.resize(n + 1);
  int c, v;
  bool flag = false;
  for (int i = 1; i <= n; ++i) {
    scanf("%d", &c);
    if (c == 0) flag = true;
    while (c--) {
      scanf("%d", &v);
      g[i].push_back(v);
      outDeg[i]++;
    }
  }
  int s;
  scanf("%d", &s);
  MaxPath(s, 0);
  if (!path.empty()) {
    puts("Win");
    for (int x : path) cout << x << " ";
    cout << endl;
  } else {
    memset(vis, 0, sizeof(vis));
    if (findCycle(s))
      puts("Draw");
    else
      puts("Lose");
  }
}
int main() {
  solve();
  return 0;
}
