#include <bits/stdc++.h>
using namespace std;
vector<int> adj[100005];
bool vis[100005][2], run[100005][2], draw, win;
int par[100005][2], wv;
void dfs(int x, bool f) {
  if (f && adj[x].empty()) win = 1, wv = x;
  vis[x][f] = 1;
  for (int i = 0; i < adj[x].size() && !win; i++) {
    int y = adj[x][i];
    if (!vis[y][f ^ 1]) par[y][f ^ 1] = x, dfs(y, f ^ 1);
  }
  return;
}
void cycle(int x, bool f) {
  vis[x][f] = 1;
  run[x][f] = 1;
  for (int i = 0; i < adj[x].size() && !draw; i++) {
    int y = adj[x][i];
    if (!vis[y][f ^ 1])
      cycle(y, f ^ 1);
    else if (run[y][f ^ 1])
      draw = 1;
  }
  run[x][f] = 0;
  return;
}
int main() {
  int n, m, s, k, x;
  scanf("%d %d", &n, &m);
  for (int i = 1; i <= n; i++) {
    scanf("%d", &k);
    while (k--) scanf("%d", &x), adj[i].push_back(x);
  }
  scanf("%d", &s);
  par[s][0] = -1;
  dfs(s, 0);
  if (win) {
    puts("Win");
    stack<int> stck;
    bool f = 1;
    while (wv != -1) {
      stck.push(wv);
      wv = par[wv][f];
      f ^= 1;
    }
    while (!stck.empty()) printf("%d ", stck.top()), stck.pop();
    puts("");
    return 0;
  }
  memset(vis, 0, sizeof vis);
  cycle(s, 0);
  if (draw)
    puts("Draw");
  else
    puts("Lose");
  return 0;
}
