//Nguyen Huu Hoang Minh
#include <bits/stdc++.h>
#define sz(x) int(x.size())
#define all(x) x.begin(),x.end()
#define reset(x) memset(x, 0,sizeof(x))
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define N 200005
#define remain(x) if (x > MOD) x -= MOD
#define ii pair<int, int>
#define iiii pair< ii , ii >
#define viiii vector< iiii >
#define vi vector<int>
#define vii vector< ii >
#define bit(x, i) (((x) >> (i)) & 1)
#define Task "test"
#define int long long

using namespace std;

typedef long double ld;
const int inf = 1e10;
const int minf = -1e10;

int n, m, s;
vector<int> a[N];
bool draw, lose, win;
bool znode[N];
int vst[N][2];
int trace[N];

void readfile()
{
    ios_base::sync_with_stdio(false);
    cin.tie(0);cout.tie(0);
    if (fopen(Task".inp","r"))
    {
        freopen(Task".inp","r",stdin);
        //freopen(Task".out","w",stdout);
    }
    cin  >> n >> m;
    for(int i=1; i<=n; i++)
    {
        int t,u;
        cin >> t;
        for(int j=1; j<=t; j++)
        {
            cin >> u;
            a[i].pb(u);
        }
    }
    cin >> s;
}

bool dfs(int u, int steps)
{
    vst[u][steps%2]=1;
    trace[steps] = u;
    if (a[u].size()==0 && steps%2){
        cout << "Win \n";
        for(int i=0; i<=steps; i++)
            cout << trace[i] << ' ';
        return true;
    }
    for(auto v : a[u])
    {
        if (vst[v][1-steps%2]==1) draw=true;
        else if (!vst[v][1-steps%2])
        {
            if (dfs(v,steps+1)) return true;
        }
    }
    vst[u][steps%2]=2;
    return false;
}

void proc()
{
    draw=false;
    if (!dfs(s,0))
    {
        if (draw) cout << "Draw";
        else cout << "Lose";
    }
}

signed main()
{
    readfile();
    proc();
    return 0;
}