Problem A
Heysáta

Unnar is visiting his uncle who lives at a farm. Unnar wants to offer his help out and his uncle has assigned him a problem to solve. His uncle lost his favorite needle in a haystack and really wants to find it. Is it possibly in the haystack Unnar is looking at? Note that this farm is quite technologically advanced, so the haystacks aren’t made of real hay, but rather of a string of length $n$ and the needle Unnars’ uncle lost is a high tech needle denoted by a letter.

Input

The first line contains the integer $n$, the number of characters in the hay stack.
The second line contains the character $k$, the needle Unnar should find, it can be a lower case or upper case letter.
The third and last line contains a string of length $n$, the haystack that Unnar should search through. The letters can be upper case or lower case letters, there are no spaces in the string.

Output

If the needle is in the haystack, print Unnar fann hana!, otherwise print Unnar fann hana ekki!.

Scoring

Group	Points	Constraints
1	100	$1 \leq n \leq 10^4$

Sample Input 1	Sample Output 1
5 a Unnar	Unnar fann hana!

Sample Input 2	Sample Output 2
2 r er	Unnar fann hana!

Sample Input 3	Sample Output 3
8 G snidugur	Unnar fann hana ekki!