#include <bits/stdc++.h>
using namespace std;
const long long inf = 1e9 + 10;
const int maxn = 2e5 + 30;
const int maxq = 1e5 + 10;
const int alf = 26;
const long long dlm = 1e9 + 7;
const long long del = 179425601;
const int eps = 1e-7;
string O[] = {"YES", "NO", "Yes", "No"};
int g0(int v) {
  int mm = maxq;
  return v + mm;
}
int c0(int v) {
  int mm = maxq;
  if (v > mm)
    return 1;
  else
    return 0;
}
vector<int> g[maxn];
int mark[maxn];
int Draw = 0, Win = 0;
vector<int> ans;
int dfs(int v) {
  mark[v] = 1;
  if (c0(v) && g[v].size() == 0) {
    Win = 1;
    if (c0(v))
      ans.push_back(v - maxq);
    else
      ans.push_back(v);
    return 0;
  }
  for (int j = 0; j < g[v].size(); j++) {
    int u = g[v][j];
    if (mark[u] == 2) continue;
    if (mark[u] == 1) {
      Draw = 1;
      continue;
    }
    dfs(u);
    if (Win == 1) {
      if (c0(v))
        ans.push_back(v - maxq);
      else
        ans.push_back(v);
      return 0;
    }
  }
  mark[v] = 2;
}
int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  int n, m;
  cin >> n >> m;
  for (int i = 1; i <= n; i++) {
    int q;
    cin >> q;
    int v = i;
    for (int j = 1; j <= q; j++) {
      int u;
      cin >> u;
      g[g0(v)].push_back(u);
      g[v].push_back(g0(u));
    }
  }
  int s;
  cin >> s;
  dfs(s);
  if (Win) {
    cout << "Win\n";
    reverse(ans.begin(), ans.end());
    for (int i = 0; i < ans.size(); i++) cout << ans[i] << " ";
    return 0;
  }
  if (Draw) {
    return cout << "Draw", 0;
  }
  cout << "Lose";
  return 0;
}
