#include <bits/stdc++.h>
using namespace std;
int n, m;
vector<vector<int> > g, g2;
vector<int> vist;
int win;
void print(int u) {
  if (u == -1) return;
  print(vist[u]);
  if (u >= n) u -= n;
  cout << u + 1 << " ";
}
void dfs(int u, int pre = -1) {
  if (vist[u] != -2) return;
  vist[u] = pre;
  if (g[u].size() == 0 && u >= n) win = u;
  for (int i = 0; i < g[u].size(); ++i) {
    dfs(g[u][i], u);
  }
}
int main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  cin >> n >> m;
  g = vector<vector<int> >(2 * n);
  g2 = vector<vector<int> >(n);
  int s, a;
  for (int i = 0; i < n; ++i) {
    cin >> s;
    for (int j = 0; j < s; ++j) {
      cin >> a;
      --a;
      g[i].push_back(n + a);
      g[i + n].push_back(a);
      g2[i].push_back(a);
    }
  }
  cin >> s;
  --s;
  vist = vector<int>(2 * n, -2);
  win = -1;
  dfs(s);
  if (win != -1) {
    cout << "Win" << endl;
    print(win);
    cout << endl;
    return 0;
  }
  vector<int> d(n, 0);
  for (int i = 0; i < n; ++i) {
    if (vist[i] != -2 || vist[i + n] != -2) {
      for (int j = 0; j < g2[i].size(); ++j) {
        ++d[g2[i][j]];
      }
    }
  }
  queue<int> q;
  q.push(s);
  while (!q.empty()) {
    int u = q.front();
    q.pop();
    for (int i = 0; i < g2[u].size(); ++i) {
      --d[g2[u][i]];
      if (d[g2[u][i]] == 0) q.push(g2[u][i]);
    }
  }
  for (int i = 0; i < n; ++i) {
    if (d[i] != 0) {
      cout << "Draw" << endl;
      return 0;
    }
  }
  cout << "Lose" << endl;
}
