#include <bits/stdc++.h>
using namespace std;
const int cap = 2e5 + 1;
vector<int> graph[cap], rev_graph[cap];
int C[cap];
vector<vector<int>> res(2, vector<int>(cap));
vector<bool> vis(cap);
int n, m, s;
void bfs() {
  queue<pair<int, int>> q;
  for (int i = 1; i <= n; ++i)
    if (!C[i]) q.push({i, 0});
  while (!q.empty()) {
    int i = q.front().first, v = q.front().second ^ 1;
    q.pop();
    for (int j : rev_graph[i])
      if (!res[v][j]) {
        res[v][j] = i;
        if (j == s && v == 1) return;
        q.push({j, v});
      }
  }
}
bool dfs(int x) {
  if (vis[x]) return true;
  vis[x] = true;
  for (int y : graph[x])
    if (dfs(y)) return true;
  vis[x] = false;
  return false;
}
int main() {
  cin >> n >> m;
  int a;
  for (int i = 1; i <= n; ++i) {
    cin >> C[i];
    for (int j = 0; j < C[i]; ++j) {
      cin >> a;
      graph[i].push_back(a);
      rev_graph[a].push_back(i);
    }
  }
  cin >> s;
  bfs();
  if (res[1][s]) {
    cout << "Win" << endl;
    int x = s, wn = 1;
    do {
      cout << x << " ";
      x = res[wn][x];
      wn ^= 1;
    } while (x);
  } else if (dfs(s))
    cout << "Draw";
  else
    cout << "Lose";
  return 0;
}
