#include <bits/stdc++.h>
using namespace std;
template <class C>
void mini(C &a4, C b4) {
  a4 = min(a4, b4);
}
template <class C>
void maxi(C &a4, C b4) {
  a4 = max(a4, b4);
}
template <class TH>
void _dbg(const char *sdbg, TH h) {
  cerr << sdbg << '=' << h << endl;
}
template <class TH, class... TA>
void _dbg(const char *sdbg, TH h, TA... a) {
  while (*sdbg != ',') cerr << *sdbg++;
  cerr << '=' << h << ',';
  _dbg(sdbg + 1, a...);
}
template <class T>
ostream &operator<<(ostream &os, vector<T> V) {
  os << "[";
  for (auto vv : V) os << vv << ",";
  return os << "]";
}
template <class L, class R>
ostream &operator<<(ostream &os, pair<L, R> P) {
  return os << "(" << P.first << "," << P.second << ")";
}
const long long MaxN = 1e5 + 100;
long long N, M, S;
vector<long long> Adj[MaxN];
bool Reachable[MaxN][2];
long long PrevVert[MaxN][2];
void dfs(long long v, long long x) {
  Reachable[v][x] = true;
  for (long long s : Adj[v])
    if (!Reachable[s][x ^ 1]) {
      PrevVert[s][x ^ 1] = v;
      dfs(s, x ^ 1);
    }
}
long long Vis[MaxN];
bool dfsCycle(long long v) {
  Vis[v] = 1;
  for (long long s : Adj[v]) {
    if (Vis[s] == 1) {
      return true;
    }
    if (Vis[s] == 0 && dfsCycle(s)) return true;
  }
  Vis[v] = 2;
  return false;
}
int32_t main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout << fixed << setprecision(11);
  if (0) cout << fixed << setprecision(6);
  cin >> N >> M;
  for (long long i = 1; i <= N; ++i) {
    long long c;
    cin >> c;
    for (long long j = 0; j < c; ++j) {
      long long v;
      cin >> v;
      Adj[i].push_back(v);
    }
  }
  cin >> S;
  dfs(S, 0);
  for (long long i = 1; i <= N; ++i) {
    if (((long long)(Adj[i]).size()) == 0 && Reachable[i][1]) {
      cout << "Win\n";
      vector<long long> Res;
      long long v = i, x = 1;
      Res.push_back(v);
      while (v != S || x != 0) {
        v = PrevVert[v][x];
        x ^= 1;
        Res.push_back(v);
      }
      reverse((Res).begin(), (Res).end());
      for (long long s : Res) {
        cout << s << " ";
      }
      cout << "\n";
      return 0;
    }
  }
  if (dfsCycle(S))
    cout << "Draw\n";
  else
    cout << "Lose\n";
}
