#include <bits/stdc++.h>
using namespace std;
typedef struct item* pitem;
vector<int> x[100001];
int used[100001][2], p[100001][2], v = -1;
bool loop = false;
void DFS(int u, int m) {
  used[u][m] = 1;
  if (x[u].size() == 0 && m == 1) v = u;
  for (int i = 0; i < x[u].size(); i++) {
    if (!used[x[u][i]][m ^ 1]) {
      p[x[u][i]][m ^ 1] = u;
      DFS(x[u][i], m ^ 1);
    } else if (used[x[u][i]][m ^ 1] == 1)
      loop = true;
  }
  used[u][m] = 2;
}
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  int n, m, s;
  cin >> n >> m;
  for (int i = 1; i <= n; i++) {
    int c;
    cin >> c;
    for (int j = 0; j < c; j++) {
      int tmp;
      cin >> tmp;
      x[i].push_back(tmp);
    }
  }
  cin >> s;
  p[s][0] = -1;
  p[s][1] = -1;
  DFS(s, 0);
  if (v == -1) {
    if (loop)
      cout << "Draw";
    else
      cout << "Lose";
    return 0;
  }
  cout << "Win\n";
  vector<int> ans;
  for (int pos = v, mode = 1; pos != -1; pos = p[pos][mode], mode ^= 1)
    ans.push_back(pos);
  reverse((ans).begin(), (ans).end());
  for (int i = 0; i < ans.size(); i++) cout << ans[i] << " ";
}
