#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
#pragma GCC optimization("unroll-loops")
long long md = 1000000007;
using namespace std;
template <typename T>
T pw(T a, T b) {
  T c = 1, m = a;
  while (b) {
    if (b & 1) c = (c * m);
    m = (m * m), b /= 2;
  }
  return c;
}
template <typename T>
T ceel(T a, T b) {
  if (a % b == 0)
    return a / b;
  else
    return a / b + 1;
}
template <typename T>
T my_log(T n, T b) {
  T i = 1, ans = 0;
  while (1) {
    if (i > n) {
      ans--;
      break;
    }
    if (i == n) break;
    i *= b, ans++;
  }
  return ans;
}
template <typename T>
T gcd(T a, T b) {
  if (b == 0) return a;
  return gcd(b, a % b);
}
long long pwmd(long long a, long long b) {
  long long c = 1, m = a;
  while (b) {
    if (b & 1) c = (c * m) % md;
    m = (m * m) % md;
    b /= 2;
  }
  return c;
}
long long modinv(long long n) { return pwmd(n, md - 2); }
long long inverse(long long i) {
  if (i == 1) return 1;
  return (md - ((md / i) * inverse(md % i)) % md + md) % md;
}
bool sortbysec(const pair<long long, long long> &a,
               const pair<long long, long long> &b) {
  return (a.second < b.second);
}
vector<int> adj[200001];
vector<int> adj2[100001];
vector<int> col(100001);
vector<int> vis2(100001);
int cyc = 0;
void dfs(int u) {
  vis2[u] = 1;
  col[u] = 1;
  for (auto s : adj2[u]) {
    if (vis2[s]) {
      if (col[s] == 1) {
        cyc = 1;
        return;
      }
      continue;
    }
    dfs(s);
  }
  col[u] = 2;
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  ;
  int n, c, a, m, s;
  cin >> n >> m;
  map<int, int> ankit;
  for (int i = 1; i < n + 1; i++) {
    cin >> c;
    while (c--)
      cin >> a, adj[i].push_back(a + n), adj[i + n].push_back(a),
          adj2[i].push_back(a);
  }
  cin >> s;
  if (adj[s].size() == 0) {
    cout << "Lose";
    return 0;
  }
  int win = 0, draw = 0;
  vector<int> vis(2 * n + 1);
  queue<int> q;
  q.push(s);
  vis[s] = 1;
  while (!q.empty()) {
    int e = q.front();
    q.pop();
    for (auto x : adj[e]) {
      if (vis[x]) continue;
      vis[x] = 1;
      ankit[x] = e;
      q.push(x);
    }
  }
  int vt;
  for (int i = 1 + n; i < 2 * n + 1; i++) {
    if (vis[i] == 0) continue;
    if (adj[i].size() == 0 && vis[i]) {
      win = 1, vt = i;
      break;
    }
  }
  dfs(s);
  draw = cyc;
  if (!win) {
    if (draw)
      cout << "Draw";
    else
      cout << "Lose";
    return 0;
  }
  cout << "Win\n";
  vector<int> ans;
  if (vt > n)
    ans.push_back(vt - n);
  else
    ans.push_back(vt);
  while (vt != s) {
    vt = ankit[vt];
    if (vt > n)
      ans.push_back(vt - n);
    else
      ans.push_back(vt);
  }
  reverse(ans.begin(), ans.end());
  for (auto x : ans) cout << x << " ";
}
