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>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

#define x first
#define y second
#define mid (l + r) / 2

void Throw (const char* e) { puts(e); exit(0); }
void Throw (int e) { printf("%d\n", e); exit(0); }

using namespace std;
using namespace __gnu_pbds;

typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
template <class T> using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;

const ll Llinf = LLONG_MAX;
const int Inf = INT_MAX;
const int Maxn = 1e5 + 10;
const int Mod = 1e9 + 7;
const double Pi = acos(-1.0);

char* _c = new char[Maxn];
string GetString()
{
    scanf("%s", _c);
    return string(_c);
}

ll pow (ll x, ll a, ll M = Llinf) {
   ll y = 1;
   while (a) {
      if (a & 1)
         y = (y * x) % M;
      x = (x * x) % M;
      a >>= 1;
   }
   return y;
}

int n, m, s;
vector<int> g[Maxn];
bool vis[Maxn][2];
int dp[Maxn][2];
int inStack[Maxn];
bool draw;

void Traverse (int s, bool p)
{
    queue<pii> Q;
    Q.push(pii(s, p));

    vis[s][p] = 1;

    while (!Q.empty())
    {
        pii v = Q.front();
        Q.pop();

        for (auto u : g[v.x])
        {
            if (!vis[u][1 - v.y])
            {
                vis[u][1 - v.y] = 1;
                dp[u][1 - v.y] = v.x;
                Q.push(pii(u, 1 - v.y));
            }
        }
    }
}

void Cycle (int v)
{

}

int main()
{
    #ifdef LOCAL
        clock_t _t = clock();
        freopen("i.txt", "r", stdin);
    #endif

    memset(dp, -1, sizeof(dp));

    scanf("%d%d", &n, &m);

    for (int i = 0, c; i < n; i++)
    {
        scanf("%d", &c);
        for (int j = 0, a; j < c; j++)
            scanf("%d", &a), g[i].push_back(a - 1);
    }
    scanf("%d", &s);
    --s;

    Traverse(s, 0);

    for (int i = 0; i < n; i++)
    {
        if (g[i].empty() && dp[i][1] >= 0)
        {
            vector<int> ans;
            int v = i, p = 1;
            while (v != s)
            {
                ans.push_back(v);
                v = dp[v][p];
                p = 1 - p;
            }
            ans.push_back(s);

            printf("Win\n");
            for (int i = ans.size() - 1; i >= 0; i--) printf("%d ", ans[i] + 1);
            printf("\n");
            return 0;
        }
    }

    Cycle(s);

    printf("Lose\n");

    #ifdef LOCAL
        cerr << (double)(clock() - _t) / CLOCKS_PER_SEC << endl;
    #endif
    return 0;
}
