#include <bits/stdc++.h>
using namespace std;
vector<int> adj[200003];
int state[200003];
bool isCycle[200003];
int parent[200003];
void dfs(int s, int p) {
  state[s] = 1;
  parent[s] = p;
  for (auto node : adj[s]) {
    if (state[node] == 1) {
      isCycle[node] = true;
      continue;
    } else if (state[node] == 0)
      dfs(node, s);
  }
  state[s] = 2;
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  int n, m;
  cin >> n >> m;
  int i;
  for (i = 1; i <= n; i++) {
    int l;
    cin >> l;
    while (l--) {
      int x;
      cin >> x;
      adj[2 * i].push_back(2 * x + 1);
      adj[2 * i + 1].push_back(2 * x);
    }
  }
  int s;
  vector<int> ans;
  cin >> s;
  dfs(s * 2, -1);
  for (i = 2; i <= 2 * n + 1; i++) {
    if (i % 2 == 1 && adj[i].empty() && state[i] == 2) {
      cout << "Win\n";
      int node = i;
      while (node != -1) {
        assert(node != 0);
        ans.push_back(node / 2);
        node = parent[node];
      }
      reverse(ans.begin(), ans.end());
      for (int a : ans) cout << a << " ";
      return 0;
    }
  }
  for (i = 2; i <= 2 * n + 1; i++)
    if (isCycle[i]) {
      cout << "Draw\n";
      return 0;
    }
  cout << "Lose\n";
  return 0;
}
