{"trustable":true,"sections":[{"title":"","value":{"format":"HTML","content":"\u003cp\u003eOne day in the jail, F·F invites Jolyne Kujo (JOJO in brief) to play tennis with her. However, Pucci the father somehow knows it and wants to stop her. There are $N$ spots in the jail and $M$ roads connecting some of the spots. JOJO finds that Pucci knows the route of the former $(K-1)$-th shortest path. If Pucci spots JOJO in one of these $K-1$ routes, Pucci will use his stand Whitesnake and put the disk into JOJO\u0027s body, which means JOJO won\u0027t be able to make it to the destination. So, JOJO needs to take the $K$-th quickest path to get to the destination. What\u0027s more, JOJO only has $T$ units of time, so she needs to hurry.\u003c/p\u003e\u003cp\u003eJOJO starts from spot $S$, and the destination is numbered $E$. It is possible that JOJO\u0027s path contains any spot more than one time. Please tell JOJO whether she can make arrive at the destination using no more than $T$ units of time.\u003c/p\u003e\u003ch3\u003eInput\u003c/h3\u003e\u003cp\u003eThere are at most $50$ test cases.\u003c/p\u003e\u003cp\u003eThe first line contains two integers $N$ and $M$ $(1 \\leq N \\leq 1000, 0 \\leq M \\leq 10000)$. Stations are numbered from $1$ to $N$.\u003c/p\u003e\u003cp\u003eThe second line contains four numbers $S, E, K$ and $T$ ( $1 \\leq S,E \\leq N$, $S \\neq E$, $1 \\leq K \\leq 10000$, $1 \\leq T \\leq 100000000$ ).\u003c/p\u003e\u003cp\u003eThen $M$ lines follows, each line containing three numbers $U, V$ and $W$ $(1 \\leq U,V \\leq N, 1 \\leq W \\leq 1000)$ . It shows that there is a directed road from $U$-th spot to $V$-th spot with time $W$.\u003c/p\u003e\u003cp\u003eIt is guaranteed that for any two spots there will be only one directed road from spot $A$ to spot $B$ $(1 \\leq A,B \\leq N, A \\neq B)$, but it is possible that both directed road $\u0026lt;A,B\u0026gt;$ and directed road $\u0026lt;B,A\u0026gt;$ exist.\u003c/p\u003e\u003cp\u003eAll the test cases are generated randomly.\u003c/p\u003e\u003ch3\u003eOutput\u003c/h3\u003e\u003cp\u003eOne line containing a sentence. If it is possible for JOJO to arrive at the destination in time, output \u003ccode\u003e\"yareyaredawa\"\u003c/code\u003e (without quote), else output \u003ccode\u003e\"Whitesnake!\"\u003c/code\u003e (without quote).\u003c/p\u003e"}},{"title":"Sample 1","value":{"format":"HTML","content":"\u003ctable class\u003d\u0027vjudge_sample\u0027\u003e\n\u003cthead\u003e\n \u003ctr\u003e\n \u003cth\u003eInput\u003c/th\u003e\n \u003cth\u003eOutput\u003c/th\u003e\n \u003c/tr\u003e\n\u003c/thead\u003e\n\u003ctbody\u003e\n \u003ctr\u003e\n \u003ctd\u003e\u003cpre\u003e2 2\n1 2 2 14\n1 2 5\n2 1 4\u003c/pre\u003e\u003c/td\u003e\n \u003ctd\u003e\u003cpre\u003eyareyaredawa\u003c/pre\u003e\u003c/td\u003e\n \u003c/tr\u003e\n\u003c/tbody\u003e\n\u003c/table\u003e\n\u003cbr /\u003e"}}]}