#include <bits/stdc++.h>
using namespace std;
const int MOD = 1000000007;
vector<int> G[110000];
int onstack[110000];
int mark[110000];
int st[2][110000];
int cycle = 0;
void dfs(int k) {
  if (cycle) return;
  mark[k] = 1;
  onstack[k] = 1;
  for (int i = 0; i < G[k].size(); i++) {
    if (mark[G[k][i]] == 0)
      dfs(G[k][i]);
    else if (onstack[G[k][i]])
      cycle = 1;
  }
  onstack[k] = 0;
}
int main() {
  int n, m;
  cin >> n >> m;
  for (int i = 0; i < n; i++) {
    int t;
    cin >> t;
    for (int j = 0; j < t; j++) {
      int temp;
      cin >> temp;
      G[i + 1].push_back(temp);
    }
  }
  int s;
  cin >> s;
  dfs(s);
  st[1][s] = -1;
  queue<int> qi;
  qi.push(s);
  while (!qi.empty()) {
    s = qi.front();
    qi.pop();
    for (int i = 0; i < G[s].size(); i++) {
      int flag = 0;
      if (st[0][s] != 0 && st[1][G[s][i]] == 0) {
        st[1][G[s][i]] = s;
        flag = 1;
      }
      if (st[1][s] != 0 && st[0][G[s][i]] == 0) {
        st[0][G[s][i]] = s;
        flag = 1;
        if (G[G[s][i]].size() == 0) {
          cout << "Win" << endl;
          vector<int> ans;
          ans.push_back(G[s][i]);
          int k = 0, ks = G[s][i];
          while (st[k][ks] != -1) {
            ans.push_back(st[k][ks]);
            ks = st[k][ks];
            k = (k + 1) % 2;
          }
          reverse(ans.begin(), ans.end());
          for (auto at : ans) cout << at << " ";
          cout << endl;
          return 0;
        }
      }
      if (flag == 1) qi.push(G[s][i]);
    }
  }
  if (cycle)
    cout << "Draw" << endl;
  else
    cout << "Lose" << endl;
}
