Ovuvuevuevue Enyetuenwuevue Ugbemugbem Osas go out hunting some animals for survival. However, he accidentally found some Ugandan children lost their way home.
After investigation, Osas found that they all have the same first name as him, which is "Ovuvuevuevue Enyetuenwuevue Ugbemugbem", but with a number last name. Not too long he found their village.
In this village, all the house has its number id. Osas supposed that if a child's last name, which is a number, matches one id of that house, the child must live in this house. Osas also found that the ids of these house are sorted in ascending order.
Now, Osas would like to ask you, the invincible programming chief of the village, the home way of these children's.
The first line contains exactly two numbers, indicates n and q described above.
The next line is the sequence <a> in ascending order, which contains exactly n integers.
Then there are q lines below. Each line contains exactly one integer, indicates the query.
1 <= n <= 106, 1 <= q <= 106, 1 <= ai <= 109, each query won't larger than 109 or smaller than 1.
For the first 4 testcases, n will not exceed 100, while n of the last 2 testcases is up to 106.
For each query, if the number exists in the sequence <a>, then output "I know de way to your home." Otherwise output "Wake up, you homeless poor."