#include <bits/stdc++.h>
using namespace std;
const int maxn = 1e5 + 10;
int vis[maxn << 1], n, m, flag;
vector<int> vertices[maxn << 1];
vector<int> ans;
void dfs1(int u) {
  if (vertices[u].size() == 0 && u > n) {
    flag = 1;
    ans.push_back(u);
    return;
  }
  vis[u] = 1;
  for (auto v : vertices[u]) {
    if (vis[v] == 1) continue;
    dfs1(v);
    if (flag) {
      ans.push_back(u);
      return;
    }
  }
}
void dfs2(int u) {
  vis[u] = 2;
  for (auto v : vertices[u]) {
    if (v > n) v -= n;
    if (vis[v] == 2) {
      flag = 1;
      return;
    }
    if (!vis[v]) dfs2(v);
    if (flag) return;
  }
  vis[u] = 1;
}
int main() {
  ios::sync_with_stdio(false);
  cin >> n >> m;
  for (int i = 1; i <= n; i++) {
    int c;
    cin >> c;
    for (int j = 1; j <= c; j++) {
      int x;
      cin >> x;
      vertices[i].push_back(x + n);
      vertices[i + n].push_back(x);
    }
  }
  int s;
  cin >> s;
  dfs1(s);
  if (flag) {
    cout << "Win" << endl;
    reverse(ans.begin(), ans.end());
    for (auto item : ans) cout << (item > n ? item - n : item) << " ";
    return 0;
  }
  memset(vis, 0, sizeof(vis));
  flag = 0;
  dfs2(s);
  if (flag)
    cout << "Draw" << endl;
  else
    cout << "Lose" << endl;
  return 0;
}
