Problem Description

Leona and Zoe have been given some words. They plan to play a game using these words:

In each round, they take turns saying a word. This word must meet the following criteria:

• It must be lexicographically larger than the previous word.
• The starting letter must be the same as the previous word's starting letter or exactly one position after it in the alphabet.

Leona starts first and will choose the lexicographically smallest word. The person who cannot say a word loses.

Both players will use optimal strategies, meaning they will choose the lexicographically smallest word that meets the conditions.

They want to know who will win.

Input Format

The first line contains two integers \( n \) and \( m \) (\( 1 \le n, m \le 10^5 \)).

The next \( n \) lines each contain a string representing a word that Leona has.

The following \( m \) lines each contain a string representing a word that Zoe has.

All input words are lowercase and unique. The total length of all words does not exceed \( 10^6 \), and they are sorted lexicographically.

Output Format

Output a single line containing either "Leona" or "Zoe", indicating the winner.

Sample Input and Output

Sample Input #1

2 1
avokado
dabar
brazil

Sample Output #1

Zoe

Sample Input #2

3 3
ananas
atlas
banana
albatros
cikla
nogomet

Sample Output #2

Leona

Sample Input #3

2 2
hrvatska
zastava
bijeli
galeb

Sample Output #3

Leona

Notes/Hints

This problem is worth a total of 110 points.

见题面 Input 部分

见题面 Output 部分