#include <bits/stdc++.h>
using namespace std;
const int duz = 200010;
vector<int> g[duz], path;
bool draw;
int vis[duz][2], n, m, x, y, s;
void dfs(int i, int par) {
  vis[i][par] = 1;
  path.push_back(i);
  if (par == 1 && g[i].size() == 0) {
    printf("Win\n");
    for (int u : path) printf("%d ", u);
    exit(0);
  }
  for (int u : g[i]) {
    int c = vis[u][par ^ 1];
    if (c == 0) dfs(u, par ^ 1);
    if (c == 1) draw = true;
  }
  vis[i][par] = 2;
  path.pop_back();
}
int main() {
  scanf("%d%d", &n, &m);
  for (int i = 1; i <= n; i++) {
    scanf("%d", &x);
    while (x--) {
      scanf("%d", &y);
      g[i].push_back(y);
    }
  }
  scanf("%d", &s);
  dfs(s, 0);
  if (draw)
    printf("Draw\n");
  else
    printf("Lose\n");
  return 0;
}
