One summer night in Krk, Leona and Zoe went for a walk. On their winding path, they found a pile of words! Excited by that, they quickly started collecting them: Leona collected words and Zoe words. After admiring them for a while, they decided to play the following game:
In one move, a player says a word from her pile. The player chooses the word in such a way that the following conditions are met: the word is lexicographically greater than the previous word, and it begins with the same letter as the previous word or with the first letter of the English alphabet after it. If a player can't make a move, she loses.
They alternate turns, and Leona plays first by saying her lexicographically smallest word. If Leona and Zoe play optimally, determine who wins.
Note: The word is lexicographically smaller than the word if the word is a prefix of the word or if in the first position in which the words and differ the letter in at that position comes before the letter in at that position.
The first line contains integers and , the number of Leona's words, and the number of Zoe's words.
The following lines contain Leona's words.
The following lines contain Zoe's words.
Words from the input contain only lowercase letters of the English alphabet, all words are mutually distinct, their total length is at most , and Leona's and Zoe's words are lexicographically sorted.
Zoe, the name of the winner.
|, each word contains at most letters|
|No additional constraints.|
Sample Input 1
2 1 avokado dabar brazil
Sample Output 1
Explanation for Sample Output 1
Leona starts with the word
avokado, then Zoe continues with her only word
brazil. Leona can't make
any move, so she loses.
Sample Input 2
3 3 ananas atlas banana albatros cikla nogomet
Sample Output 2
Sample Input 3
2 2 hrvatska zastava bijeli galeb
Sample Output 3