DAG game
You'll never be able to return! from the animated film "All Dogs Go to Heaven"
In the Land of Fools, there's a unique challenge — one-way roads. These roads connect the cities in such a way that once you leave a city, you cannot return to it without violating traffic rules. Additionally, some cities have tank platoons stationed in them.
Currently, large-scale military maneuvers are underway, led by General Lutik and Admiral Kosulko. The training exercise works as follows: on the first day, the general selects a tank platoon and orders it to move from its current city to a neighboring one via one of the roads. On the second day, the admiral does the same, and they continue to alternate. If either commander cannot make a legal move, they are immediately demoted, and their counterpart is promoted to marshal, ending the exercise. While the commanders may not be known for their intelligence, they have experienced military advisors, ensuring that both will make optimal moves.
Your task is to determine who will lead the valiant army of the Land of Fools, as the marshal's uniform needs to be ordered in advance.
Input
The first line of the input contains three natural numbers N, M, K (N, M, K ≤ 10^5) — representing the number of cities, the number of roads, and the number of tank platoons, respectively. The next M lines each contain a pair of numbers — the city numbers connected by a one-way road. The first number is the starting city, and the second is the destination. The last line contains K natural numbers — the city numbers where the tank platoons are stationed. Numbers may repeat. All cities are numbered starting from 1.
Output
Print "Lutik" without quotes if the general wins, or "Kosulko" if the admiral is the winner.