#include <bits/stdc++.h>
using namespace std;
const int MOD = 1e9 + 7;
const int C = 26;
void add(int &x, int y) {
  x += y;
  while (x >= MOD) x -= MOD;
  while (x < 0) x += MOD;
}
int fix(int x) {
  while (x >= MOD) x -= MOD;
  while (x < 0) x += MOD;
  return x;
}
int pw(int a, int b) {
  int ret = 1;
  while (b) {
    if (b & 1) ret = 1ll * ret * a % MOD;
    b >>= 1;
    a = 1ll * a * a % MOD;
  }
  return ret;
}
const int MAXN = 1e6 + 10;
int n, m, in[MAXN];
vector<int> g[MAXN];
bool draw;
int vec[MAXN];
void dfs(int u) {
  vec[u] = 1;
  for (int v : g[u]) {
    if (!vec[v]) {
      dfs(v);
    } else if (vec[v] == 1) {
      draw = 1;
    }
  }
  vec[u] = 2;
}
bool vis[MAXN][2];
pair<int, int> qu[MAXN], p[MAXN][2];
int sz;
void bfs(int src) {
  vis[src][0] = 1;
  qu[sz++] = {src, 0};
  for (int i = 0; i < sz; i++) {
    auto [u, f] = qu[i];
    for (int v : g[u]) {
      if (!vis[v][f ^ 1]) {
        vis[v][f ^ 1] = 1;
        p[v][f ^ 1] = {u, f};
        qu[sz++] = {v, f ^ 1};
      }
    }
  }
}
void get_ans(int u, int f) {
  if (!u) return;
  get_ans(p[u][f].first, p[u][f].second);
  cout << u << " ";
}
void solve() {
  cin >> n >> m;
  for (int i = 1; i <= n; i++) {
    int out;
    cin >> out;
    g[i].resize(out);
    for (int &v : g[i]) cin >> v;
  }
  int src;
  cin >> src;
  dfs(src);
  bfs(src);
  for (int i = 1; i <= n; i++) {
    if (g[i].empty() && vis[i][1]) {
      cout << "Win\n";
      get_ans(i, 1);
      cout << "\n";
      return;
    }
  }
  if (draw) {
    cout << "Draw\n";
  } else {
    cout << "Lose\n";
  }
}
int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  int te = 1;
  for (int w = 1; w <= te; w++) {
    solve();
  }
  return 0;
}
