#include <bits/stdc++.h>
using namespace std;
void __print(int x) { cerr << x; }
void __print(long x) { cerr << x; }
void __print(long long x) { cerr << x; }
void __print(unsigned x) { cerr << x; }
void __print(unsigned long x) { cerr << x; }
void __print(unsigned long long x) { cerr << x; }
void __print(float x) { cerr << x; }
void __print(double x) { cerr << x; }
void __print(long double x) { cerr << x; }
void __print(char x) { cerr << '\'' << x << '\''; }
void __print(const char *x) { cerr << '\"' << x << '\"'; }
void __print(const string &x) { cerr << '\"' << x << '\"'; }
void __print(bool x) { cerr << (x ? "true" : "false"); }
template <typename T, typename V>
void __print(const pair<T, V> &x) {
  cerr << '{';
  __print(x.first);
  cerr << ',';
  __print(x.second);
  cerr << '}';
}
template <typename T>
void __print(const T &x) {
  int f = 0;
  cerr << '{';
  for (auto &i : x) cerr << (f++ ? "," : ""), __print(i);
  cerr << "}";
}
void _print() { cerr << "]\n"; }
template <typename T, typename... V>
void _print(T t, V... v) {
  __print(t);
  if (sizeof...(v)) cerr << ", ";
  _print(v...);
}
vector<long long> adj[200005];
long long vis[200005][2];
long long draw;
vector<long long> ans;
long long dfs(long long u, long long p) {
  vis[u][p] = 1;
  ans.push_back(u);
  if (adj[u].size() == 0 && p == 1) {
    cout << "Win"
         << "\n";
    for (auto x : ans) cout << x << " ";
    exit(0);
  }
  for (auto child : adj[u]) {
    if (vis[child][p ^ 1] == 1)
      draw = 1;
    else if (!vis[child][p ^ 1])
      dfs(child, p ^ 1);
  }
  vis[u][p] = 2;
  ans.pop_back();
}
long long solve() {
  long long n, m;
  cin >> n >> m;
  for (long long i = 1; i <= n; i++) {
    long long k;
    cin >> k;
    for (long long j = 0; j < k; j++) {
      long long to;
      cin >> to;
      adj[i].push_back(to);
    }
  }
  long long start;
  cin >> start;
  dfs(start, 0);
  if (draw)
    cout << "Draw"
         << "\n";
  else
    cout << "Lose"
         << "\n";
}
signed main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  long long t;
  t = 1;
  while (t--) {
    solve();
  }
}
