#include <bits/stdc++.h>
using namespace std;
vector<vector<int>> adj(200001);
bool cyclefound = false;
int visited[200001][2];
int last[200001][2];
void dfs(int pos, int player) {
  visited[pos][player] = 1;
  for (int temp = 0; temp < adj[pos].size(); temp++) {
    int thenode = adj[pos][temp];
    if (visited[thenode][player ^ 1] == 0) {
      last[thenode][player ^ 1] = pos;
      dfs(thenode, player ^ 1);
    } else if (visited[thenode][player ^ 1] == 1)
      cyclefound = true;
  }
  visited[pos][player] = 2;
}
int start;
vector<int> ans;
void btrack(int pos, int player) {
  ans.push_back(pos);
  if ((pos != start) || (player != 0)) btrack(last[pos][player], player ^ 1);
}
int main() {
  int n, m;
  cin >> n >> m;
  int temp, temp2;
  vector<int> out;
  for (int tmp = 1; tmp <= n; tmp++) {
    int x;
    cin >> x;
    if (x == 0) out.push_back(tmp);
    for (temp = 0; temp < x; temp++) {
      int y;
      cin >> y;
      adj[tmp].push_back(y);
    }
  }
  cin >> start;
  dfs(start, 0);
  for (temp = 0; temp < out.size(); temp++) {
    int c = out[temp];
    if (visited[c][1] == 2) {
      cout << "Win\n";
      btrack(c, 1);
      for (int temp = ans.size() - 1; temp >= 0; temp--) {
        cout << ans[temp];
        if (temp != 0) cout << " ";
      }
      cout << "\n";
      return 0;
    }
  }
  if (cyclefound)
    cout << "Draw\n";
  else
    cout << "Lose\n";
}
