Codeforces 936B-Sleepy Game

Sleepy Game

time limit per test

2 seconds

memory limit per test

256 megabytes

input

standard input

output

standard output

Petya and Vasya arranged a game. The game runs by the following rules. Players have a directed graph consisting of n vertices and medges. One of the vertices contains a chip. Initially the chip is located at vertex s. Players take turns moving the chip along some edge of the graph. Petya goes first. Player who can't move the chip loses. If the game lasts for 106 turns the draw is announced.

Vasya was performing big laboratory work in "Spelling and parts of speech" at night before the game, so he fell asleep at the very beginning of the game. Petya decided to take the advantage of this situation and make both Petya's and Vasya's moves.

Your task is to help Petya find out if he can win the game or at least draw a tie.

Input

The first line of input contain two integers n and m — the number of vertices and the number of edges in the graph (2 ≤ n ≤ 105, 0 ≤ m ≤ 2·105).

The next n lines contain the information about edges of the graph. i-th line (1 ≤ i ≤ n) contains nonnegative integer ci — number of vertices such that there is an edge from i to these vertices and ci distinct integers ai, j — indices of these vertices (1 ≤ ai, j ≤ n, ai, j ≠ i).

It is guaranteed that the total sum of ci equals to m.

The next line contains index of vertex s — the initial position of the chip (1 ≤ s ≤ n).

Output

If Petya can win print «Win» in the first line. In the next line print numbers v1, v2, ..., vk (1 ≤ k ≤ 106) — the sequence of vertices Petya should visit for the winning. Vertex v1 should coincide with s. For i = 1... k - 1 there should be an edge from vi to vi + 1 in the graph. There must be no possible move from vertex vk. The sequence should be such that Petya wins the game.

If Petya can't win but can draw a tie, print «Draw» in the only line. Otherwise print «Lose».

Examples

input

Copy

5 6
2 2 3
2 4 5
1 4
1 5
0
1

output

Win
1 2 4 5 

input

Copy

3 2
1 3
1 1
0
2

output

Lose

input

Copy

2 2
1 2
1 1
1

output

Draw

Note

In the first example the graph is the following:

Initially the chip is located at vertex 1. In the first move Petya moves the chip to vertex 2, after that he moves it to vertex 4 for Vasya. After that he moves to vertex 5. Now it is Vasya's turn and there is no possible move, so Petya wins.

In the second example the graph is the following:

Initially the chip is located at vertex 2. The only possible Petya's move is to go to vertex 1. After that he has to go to 3 for Vasya. Now it's Petya's turn but he has no possible move, so Petya loses.

In the third example the graph is the following:

Petya can't win, but he can move along the cycle, so the players will draw a tie.

题意：Petya和Vasya在玩移动旗子的游戏，谁不能移动就输了。Vasya在订移动计划的时候睡着了，Petya就想趁着Vasya睡着的时候同时定下策略， 如果可以赢得话输出Win并输出路径，如果步数在达到1e6的情况下，就认定为平局，输出Draw，如果输的话就输出lost。

解题思路：先从给定的点开始搜索，看能不能走到一个出度为0的点且路径长度为奇数，如果能则获胜，vis[u][0]==1表示u这个点能从给定点偶数路径到达，vis[u][1]==1表示u这个点能从给定点奇数路径到达，否则就看从给定点开始走，能否找到一个环，如果能则为平局，否则就输了。

#include <iostream>  
#include <cstdio>  
#include <cstring>  
#include <string>  
#include <algorithm>  
#include <map>  
#include <set>  
#include <stack>  
#include <queue>  
#include <vector>  
#include <bitset>  
#include <functional>  

using namespace std;

#define LL long long       
const int INF = 0x3f3f3f3f;

int n, m;
int s[100009], nt[200009], e[200009];
int out[100009], vis[100009][2], v, ss;
int cnt, flag[100009];

struct node
{
	int x, y;
}pre, nt1;

int dfs(int k)
{
	flag[k] = 1;
	for (int i = s[k]; ~i; i = nt[i])
	{
		if (flag[e[i]] == 1) return 1;
		else if (flag[e[i]] == 0)
		{
			if (dfs(e[i])) return 1;
		}
	}
	flag[k] = 2;
	return 0;
}

int main()
{
	while (~scanf("%d %d", &n, &m))
	{
		cnt = 0;
		memset(s, -1, sizeof s);
		for (int i = 1; i <= n; i++)
		{
			scanf("%d", &out[i]);
			for (int j = 0; j < out[i]; j++)
			{
				scanf("%d", &v);
				nt[cnt] = s[i], s[i] = cnt, e[cnt++] = v;
			}
		}
		scanf("%d", &ss);
		memset(vis, 0, sizeof vis);
		memset(flag, 0, sizeof flag);
		pre.x = ss, pre.y = 0;
		vis[ss][0] = -1;
		queue<node>q;
		q.push(pre);
		while (!q.empty())
		{
			pre = q.front();
			q.pop();
			for (int i = s[pre.x]; ~i; i = nt[i])
			{
				if (!vis[e[i]][pre.y ^ 1])
				{
					vis[e[i]][pre.y ^ 1] = pre.x;
					nt1.x = e[i], nt1.y = pre.y ^ 1;
					q.push(nt1);
				}
			}
		}
		int flag = 0;
		for (int i = 1; i <= n; i++)
		{
			if ((!out[i]) && vis[i][1])
			{
				printf("Win\n");
				int now = 1, k = i;
				vector<int>ans;
				while (k != -1)
				{
					ans.push_back(k);
					k = vis[k][now];
					now ^= 1;
				}
				for (int j = ans.size() - 1; j >= 0; j--)
				{
					if (j) printf("%d ", ans[j]);
					else printf("%d\n", ans[j]);
				}
				flag = 1;
				break;
			}
		}
		if (!flag)
		{
			if (dfs(ss)) printf("Draw\n");
			else printf("Lose\n");
		}
	}
	return 0;
}