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;
void func(void) {
  freopen("input.c", "r", stdin);
  freopen("output.c", "w", stdout);
}
const int N = 2e5 + 10;
vector<long long> a[N];
long long vis[N], dis[N][2], par[N][2];
long long aa;
vector<long long> leaf;
void bfs(int x) {
  queue<long long> q;
  par[x][0] = par[x][1] = -1;
  q.push(x);
  dis[x][0] = 0;
  for (int i = 0; i < N; i++)
    dis[i][0] = dis[i][1] = par[i][0] = par[i][1] = -1;
  dis[x][0] = 0;
  while (!q.empty()) {
    int y = q.front();
    q.pop();
    if (a[y].size() == 0) {
      leaf.push_back(y);
    }
    for (int i = 0; i < a[y].size(); i++) {
      int z = a[y][i];
      if (dis[y][0] != -1 and dis[z][1] == -1) {
        dis[z][1] = dis[y][0] + 1;
        par[z][1] = y;
        q.push(z);
      }
      if (dis[y][1] != -1 and dis[z][0] == -1) {
        dis[z][0] = dis[y][1] + 1;
        par[z][0] = y;
        q.push(z);
      }
    }
  }
}
int flag = 0;
void dfs(int x) {
  vis[x] = 1;
  for (int i = 0; i < a[x].size(); i++) {
    int y = a[x][i];
    if (!vis[y]) dfs(y);
    if (vis[y] == 1) flag = 1;
  }
  vis[x] = 2;
}
stack<long long> st;
long long d = 0;
void printPath(long long y, long long dis, long long dd) {
  st.push(y);
  d = max(d, dd);
  if (dis & 1) {
    if (par[y][1] == -1) return;
    printPath(par[y][1], 0, dd + 1);
  } else {
    if (par[y][0] == -1) return;
    printPath(par[y][0], 1, dd + 1);
  }
}
int main() {
  long long n, q, i, j = 0, temp, t, k, ans = 0, sum = 0, x, y, z, cnt = 0, m,
                     fg = 0, mx = 0, mx1 = 0, mn = 8000000000000000000,
                     mn1 = 8000000000000000000;
  scanf("%lld %lld", &n, &m);
  for (int i = 1; i <= n; i++) {
    scanf("%lld", &x);
    while (x--) {
      scanf("%lld", &y);
      a[i].push_back(y);
    }
  }
  scanf("%lld", &x);
  dfs(x);
  bfs(x);
  for (int i = 0; i < leaf.size(); i++) {
    y = leaf[i];
    if (dis[y][1] != -1) {
      ans = y;
      fg = 1;
      break;
    }
  }
  if (fg == 0) {
    if (flag)
      cout << "Draw\n";
    else
      cout << "Lose\n";
    return 0;
  }
  printPath(ans, 1, 1);
  if (d == 1) {
    cout << "Lose\n";
    return 0;
  }
  cout << "Win\n";
  while (!st.empty()) {
    x = st.top();
    st.pop();
    printf("%lld ", x);
  }
}
