#include <bits/stdc++.h>
#pragma GCC optimize("O3")
using namespace std;
inline long long getint() {
  long long _x = 0, _tmp = 1;
  char _tc = getchar();
  while ((_tc < '0' || _tc > '9') && _tc != '-') _tc = getchar();
  if (_tc == '-') _tc = getchar(), _tmp = -1;
  while (_tc >= '0' && _tc <= '9') _x *= 10, _x += (_tc - '0'), _tc = getchar();
  return _x * _tmp;
}
inline long long add(long long _x, long long _y,
                     long long _mod = 1000000007LL) {
  _x += _y;
  return _x >= _mod ? _x - _mod : _x;
}
inline long long sub(long long _x, long long _y,
                     long long _mod = 1000000007LL) {
  _x -= _y;
  return _x < 0 ? _x + _mod : _x;
}
inline long long mul(long long _x, long long _y,
                     long long _mod = 1000000007LL) {
  _x *= _y;
  return _x >= _mod ? _x % _mod : _x;
}
long long mypow(long long _a, long long _x, long long _mod) {
  if (_x == 0) return 1LL;
  long long _ret = mypow(mul(_a, _a, _mod), _x >> 1, _mod);
  if (_x & 1) _ret = mul(_ret, _a, _mod);
  return _ret;
}
long long mymul(long long _a, long long _x, long long _mod) {
  if (_x == 0) return 0LL;
  long long _ret = mymul(add(_a, _a, _mod), _x >> 1, _mod);
  if (_x & 1) _ret = add(_ret, _a, _mod);
  return _ret;
}
inline bool equal(double _x, double _y) {
  return _x > _y - 1e-9 && _x < _y + 1e-9;
}
void sleep(double sec = 1021) {
  clock_t s = clock();
  while (clock() - s < CLOCKS_PER_SEC * sec)
    ;
}
int __ = 1, _cs;
struct Scc {
  int n, nScc, vst[202020], bln[202020];
  vector<int> E[202020], rE[202020], vec;
  void init(int _n) {
    n = _n;
    for (int i = 0; i < 202020; i++) {
      E[i].clear();
      rE[i].clear();
    }
  }
  void add_edge(int u, int v) {
    E[u].push_back(v);
    rE[v].push_back(u);
  }
  void DFS(int u) {
    vst[u] = 1;
    for (auto v : E[u])
      if (!vst[v]) DFS(v);
    vec.push_back(u);
  }
  void rDFS(int u) {
    vst[u] = 1;
    bln[u] = nScc;
    for (auto v : rE[u])
      if (!vst[v]) rDFS(v);
  }
  void solve() {
    nScc = 0;
    vec.clear();
    memset(vst, 0, sizeof(vst));
    for (int i = 1; i <= n; i++)
      if (!vst[i]) DFS(i);
    reverse(vec.begin(), vec.end());
    memset(vst, 0, sizeof(vst));
    for (auto v : vec) {
      if (!vst[v]) {
        rDFS(v);
        nScc++;
      }
    }
  }
} graph;
void build() {}
int n, m, out[202020], s;
void init() {
  n = getint();
  m = getint();
  graph.init(n);
  for (int i = 1; i <= n; i++) {
    int ci = getint();
    out[i] = ci;
    while (ci--) graph.add_edge(i, getint());
  }
  graph.solve();
  s = getint();
}
bool can_draw;
int sz[202020];
bool got[202020];
int bk[202020];
void solve() {
  for (int i = 1; i <= n; i++) sz[graph.bln[i]]++;
  queue<int> Q;
  Q.push(s);
  got[s] = true;
  while (Q.size()) {
    int tn = Q.front();
    Q.pop();
    int sft = (tn <= n ? n : 0);
    int _me = tn <= n ? tn : tn - n;
    for (int nxt : graph.E[_me]) {
      int rnxt = nxt + sft;
      if (got[rnxt]) continue;
      got[rnxt] = true;
      bk[rnxt] = tn;
      Q.push(rnxt);
    }
  }
  for (int i = 1; i <= n; i++)
    if (out[i] == 0 and got[i + n]) {
      puts("Win");
      int now = i + n;
      vector<int> ans;
      while (now != s) {
        ans.push_back(now > n ? now - n : now);
        now = bk[now];
      }
      ans.push_back(s);
      reverse(ans.begin(), ans.end());
      for (size_t j = 0; j < ans.size(); j++)
        printf("%d%c", ans[j], " \n"[j + 1 == ans.size()]);
      exit(0);
    } else if ((got[i] or got[i + n]) and sz[graph.bln[i]] > 1)
      can_draw = true;
  puts(can_draw ? "Draw" : "Lose");
}
int main() {
  build();
  while (__--) {
    init();
    solve();
  }
}
