DAG game#5871
You'll never be able to return! from the animated film "All Dogs Go to Heaven"
In the Land of Fools, there is only one problem: one-way roads. These roads connect cities in such a way that once you leave a city, you cannot return to it, except by violating traffic rules. Additionally, some cities have tank platoons stationed in them.
Currently, large-scale military exercises are underway under the leadership of General Lutik and Admiral Kosulko. The essence of the exercise is as follows: on the first day, the general selects a tank platoon and orders it to move from its current city to a neighboring city via one of the roads. On the second day, the admiral performs a similar action, and so on. If any of the commanders cannot make a legal move, they are immediately demoted, and their counterpart is promoted to marshal. After this, the exercises end. The military commanders may lack intelligence, but they have experienced military advisors, so you can be sure both will always make optimal moves.
Your task is to determine who will lead the valiant army of the Land of Fools, as the marshal's uniform must be ordered in advance.
The first line contains three natural numbers , , (1 \leq N, M, K \leq 10^5) — the number of cities in the Land of Fools, the number of roads, and the number of tank platoons, respectively.
Each of the next lines contains two numbers: the indices of two cities connected by a one-way road. The first number is the source city, and the second is the destination city.
The last line contains natural numbers — the indices of the cities where the tank platoons are stationed. Numbers may repeat. All cities are numbered starting from .
Print Lutik if the general wins, or Kosulko if the admiral wins.
Example 1