#include <bits/stdc++.h>
using namespace std;
inline long long ma(long long a, long long b) { return ((a - b > 0) ? a : b); }
inline long long mi(long long a, long long b) { return ((a - b > 0) ? b : a); }
template <typename Arg1>
void __f(const char* name, Arg1&& arg1) {
  cerr << name << " : " << arg1 << endl;
}
template <typename Arg1, typename... Args>
void __f(const char* names, Arg1&& arg1, Args&&... args) {
  const char* comma = strchr(names + 1, ',');
  cerr.write(names, comma - names) << " : " << arg1 << " | ";
  __f(comma + 1, args...);
}
vector<long long> adj[1000010], v;
long long mark[1000010];
long long vis[2][1000010], ans[1000010], re[1000010], cur = 0;
inline void solve(long long g, long long u, long long d) {
  if (cur == 1) return;
  if (mark[u] == 1 && g == 1) {
    ans[d++] = u;
    for (long long(i) = (0); (i) < (d); (i)++) v.push_back(ans[i]);
    cur = 1;
    return;
  }
  if (vis[g][u] == 1) return;
  vis[g][u] = 1;
  ans[d] = u;
  for (auto xd : adj[u]) solve((g + 1) % 2, xd, d + 1);
  return;
}
inline void find(long long u, long long& state) {
  if (cur == 2) return;
  if (re[u]) {
    state = 2, cur = 2;
    return;
  }
  re[u] = 1;
  for (auto xd : adj[u]) find(xd, state);
  re[u] = 0;
}
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  ;
  long long n, m;
  cin >> n >> m;
  for (long long(i) = (0); (i) < (n); (i)++) {
    long long c;
    cin >> c;
    if (c == 0) mark[i] = 1;
    for (long long(j) = (0); (j) < (c); (j)++) {
      long long x;
      cin >> x;
      x--;
      adj[i].push_back(x);
    }
  }
  long long sn, flag = 0;
  cin >> sn;
  sn--;
  v.clear();
  solve(0, sn, 0);
  if (v.size() != 0) {
    cout << "Win" << endl;
    for (auto xd : v) cout << xd + 1 << " ";
    cout << endl;
  } else {
    find(sn, flag);
    (flag == 2) ? cout << "Draw"
                       << "\n"
                : cout << "Lose"
                       << "\n";
  }
  return 0;
}
