#include <bits/stdc++.h>
using namespace std;
vector<int> v[(1 << 18)];
vector<int> o;
int e[(1 << 18)][2];
int t;
int s[(1 << 18)];
void dfs(int i, int j, int p) {
  if (s[i] == 2) t = true;
  if (e[i][p]) {
    return;
  }
  s[i] = 2;
  o.push_back(i);
  e[i][p] = 1;
  if (v[i].size() == 0 && p == 0) {
    cout << "Win" << endl;
    for (int i : o) cout << i << " ";
    cout << endl;
    exit(0);
  }
  for (int k : v[i]) {
    if (k == j) t = true;
    dfs(k, i, 1 - p);
  }
  s[i] = 1;
  o.pop_back();
}
int main() {
  int n, m;
  cin >> n >> m;
  for (int i = 1; i <= n; i++) {
    int a;
    cin >> a;
    while (a-- > 0) {
      int x;
      cin >> x;
      v[i].push_back(x);
    }
  }
  int s;
  cin >> s;
  dfs(s, -1, 1);
  if (t)
    cout << "Draw" << endl;
  else
    cout << "Lose" << endl;
}
