11 20
1 2
2 7 6
1 7
4 10 9 3 2
2 9 2
1 3
0
0
3 1 6 7
4 11 7 5 6
2 2 8
4
 5 5
1 2
1 3
2 1 4
1 5
0
1
 5 5
1 2
1 3
2 2 4
1 5
0
1
 4 3
1 2
1 3
1 1
0
1
 6 6
1 2
2 3 6
1 4
0
1 3
1 5
2
 5 5
1 2
2 3 5
1 4
1 2
0
1
 5 5
2 2 3
1 4
1 5
1 3
0
1
 6 6
1 2
2 3 6
1 4
1 5
1 1
0
1
 5 5
1 2
2 4 3
0
1 5
1 2
1
 6 6
2 2 3
1 4
1 4
1 5
1 6
0
1
 5 5
2 2 3
2 4 5
1 5
0
0
1
 5 5
2 2 4
1 3
1 4
1 5
0
1
 57 39
1 57
1 40
1 38
0
0
0
1 20
0
0
1 53
0
0
0
1 36
1 40
1 27
1 11
1 7
1 35
0
1 23
1 44
1 14
1 54
0
1 21
1 28
1 37
1 38
1 26
1 3
0
1 14
0
1 1
1 10
1 52
1 45
0
1 16
0
1 22
1 51
1 48
1 30
1 30
0
1 19
1 33
0
1 45
1 42
1 49
0
1 23
0
1 31
15
 15 20
3 4 9 7
0
1 1
3 5 6 1
1 13
0
4 8 15 4 2
1 7
1 2
0
1 4
0
2 3 11
1 5
2 1 6
4
 5 5
2 2 3
1 4
0
1 5
1 4
2
 6 6
2 2 3
1 4
1 5
0
1 6
1 4
1
 4 4
2 2 4
1 3
1 1
0
3
 2 1
0
1 1
1
 8 8
2 2 5
1 3
1 7
0
1 6
1 8
1 4
1 4
1
 5 5
1 2
1 3
1 4
2 3 5
0
1
 4 4
2 2 3
1 4
1 4
0
1
 5 5
1 2
2 3 4
0
1 5
1 3
1
 6 6
1 2
2 3 4
1 5
1 5
1 6
0
1
 3 2
1 2
1 1
0
3
 5 5
2 2 3
1 5
1 4
1 5
0
1
 92 69
1 76
1 14
1 9
0
1 46
1 80
0
0
1 77
0
1 53
1 81
1 61
1 40
0
1 20
1 71
1 24
1 54
1 82
1 23
0
1 63
1 25
1 38
1 68
0
1 65
0
1 76
1 55
1 87
1 1
1 37
1 68
1 30
1 17
1 19
0
1 16
1 69
0
1 60
1 86
0
1 44
1 32
1 10
1 8
0
0
0
0
0
1 2
1 39
0
1 74
1 5
1 28
1 79
1 32
1 34
0
1 81
1 85
1 6
1 18
0
0
1 58
1 88
1 7
1 78
1 43
1 5
1 61
1 90
1 31
1 75
1 72
1 80
1 13
0
0
1 21
1 70
1 30
0
1 68
1 3
1 62
91
 5 5
2 2 4
1 3
1 1
1 5
0
1
 3 3
1 2
2 1 3
0
1
 6 6
2 2 4
1 3
0
1 5
1 6
1 3
1
 53 38
0
1 35
0
1 32
0
0
1 49
1 25
0
1 19
0
0
1 25
1 48
1 50
1 2
1 4
1 50
1 34
1 4
1 46
0
1 4
1 5
1 43
1 8
1 40
1 47
1 21
1 43
0
1 10
1 27
1 33
1 20
1 26
0
0
0
1 53
0
0
1 45
1 23
1 7
1 52
1 51
0
1 29
1 48
1 36
1 2
1 28
2
 8 8
2 2 3
1 4
1 4
1 5
1 6
0
1 8
1 7
1
 5 5
1 2
1 3
1 4
2 2 5
0
1

Win
4 10 11 8
 Win
1 2 3 1 2 3 4 5
 Draw
 Draw
 Lose
 Win
1 2 3 4 2 5
 Lose
 Win
1 2 3 4 5 1 2 6
 Win
1 2 4 5 2 3
 Lose
 Lose
 Lose
 Draw
 Win
4 5 13 3 1 4 5 13 3 1 9 2
 Draw
 Lose
 Win
3 1 2 3 1 4
 Lose
 Lose
 Draw
 Lose
 Lose
 Lose
 Lose
 Win
1 3 4 5
 Lose
 Win
1 2 3 1 4 5
 Draw
 Lose
 Draw
 Lose
 Win
1 2 3 4 2 3 4 5

#include <bits/stdc++.h>
using namespace std;
const int N = 100010;
int n, m, size;
struct edg {
  int to, next;
} e[2 * N];
struct b {
  int x, y;
} G[2 * N];
int x, y, num, head[N], dfn[N], low[N], vis[N], du[N], cnt, chu[N];
int f[N][2], pre[N][2], fa[N], st[N], h, tot, S;
int q[N], he, ta;
bool used[N][2];
vector<int> p[N], ans;
void add(int x, int y) {
  size++;
  e[size].to = y;
  e[size].next = head[x];
  head[x] = size;
}
void dfs(int x) {
  cnt++;
  dfn[x] = low[x] = cnt;
  st[++h] = x;
  vis[x] = 1;
  for (int i = head[x]; i; i = e[i].next) {
    int y = e[i].to;
    if (vis[y] == 0)
      dfs(y), low[x] = min(low[x], low[y]);
    else if (vis[y] == 1)
      low[x] = min(low[x], dfn[y]);
  }
  if (low[x] == dfn[x]) {
    tot++;
    while (st[h] != x)
      vis[st[h]] = 2, fa[st[h]] = tot, p[tot].push_back(st[h]), h--;
    vis[st[h]] = 2, fa[st[h]] = tot, p[tot].push_back(st[h]), h--;
  }
}
int main() {
  scanf("%d%d", &n, &m);
  for (int i = 1; i <= n; i++) {
    scanf("%d", &num);
    for (int j = 1; j <= num; j++)
      scanf("%d", &x), add(i, x), G[size].x = i, G[size].y = x;
  }
  scanf("%d", &S);
  for (int i = 1; i <= n; i++)
    if (vis[i] == 0) dfs(i);
  memset(head, 0, sizeof(head));
  size = 0;
  for (int i = 1; i <= m; i++)
    if (fa[G[i].x] != fa[G[i].y])
      chu[fa[G[i].x]]++, du[fa[G[i].y]]++, add(fa[G[i].x], fa[G[i].y]);
  S = fa[S];
  if (chu[S] == 0) {
    if (p[S].size() == 1)
      printf("Win\n%d", p[S][0]);
    else
      printf("Draw");
    return 0;
  }
  q[++ta] = S;
  if ((p[S].size() & 1) && p[S].size() > 1)
    f[S][1] = f[S][0] = 1, used[S][1] = 1;
  else
    f[S][0] = 1;
  while (he < ta) {
    int x = q[++he];
    for (int i = head[x]; i; i = e[i].next) {
      int y = e[i].to;
      du[y]--;
      f[y][1] = f[x][0], f[y][0] = f[x][1];
      if (f[y][1]) pre[y][1] = x;
      if (f[y][0]) pre[y][0] = x;
      if (du[y] == 0) {
        if ((p[y].size() & 1) && p[y].size() > 1) {
          if (!f[y][0]) used[y][0] = 1, pre[y][0] = x;
          if (!f[y][1]) used[y][1] = 1, pre[y][1] = x;
          f[y][0] = f[y][1] = 1;
        }
        q[++ta] = y;
      }
    }
  }
  for (int i = 1; i <= tot; i++)
    if (chu[i] == 0 && f[i][1] && p[i].size() == 1) {
      printf("Win\n");
      int nw = i, jo = 1;
      while (nw) {
        if (used[nw][jo]) {
          ans.push_back(p[nw][p[nw].size() - 1]);
          for (int j = 0; j < p[nw].size(); j++) ans.push_back(p[nw][j]);
          nw = pre[nw][jo];
        } else {
          ans.push_back(p[nw][p[nw].size() - 1]);
          nw = pre[nw][jo];
          jo ^= 1;
        }
      }
      for (int i = ans.size() - 1; i >= 0; i--) printf("%d ", ans[i]);
      return 0;
    }
  printf("Lose");
}
