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 \(n\) words, and Zoe \(m\) 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 \(A\) \(is\) lexicographically smaller than the word \(B\) \(if\) the word \(A\) \(is\) \(a\) prefix \(of\) the word \(B\) \(or\)
\(if\) \(in\) the first position \(in\) which the words \(A\) and \(B\) differ the letter \(in\) \(A\) \(at\) that position comes before the
letter \(in\) \(B\) \(at\) that position.

Subtask 1 (20 points): n, \(m \le 100\), each word contains at most 10 letters

Subtask 2 (30 points): n, \(m \le 1\,000\)

Subtask 3 (60 points): No additional constraints.

The first line contains integers \(n\) and \(m\) (\(1 \le n\), \(m \le 10^{5}\)), the number of Leona’s words, and the number
of Zoe’s words.
The following \(n\) lines contain Leona’s words.
The following \(m\) 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 \(10^{6}\), and Leona’s and Zoe’s words are lexicographically sorted.

Output Leona or Zoe, the name of the winner.

생성자가 기록되지 않았습니다.

출처 COCI 2022/2023 Contest 2