CF755B.PolandBall and Game

PolandBall is playing a game with EnemyBall. The rules are simple. Players have to say words in turns. You cannot say a word which was already said. PolandBall starts. The Ball which can't say a new word loses.

You're given two lists of words familiar to PolandBall and EnemyBall. Can you determine who wins the game, if both play optimally?

PolandBall 正在与 EnemyBall 进行一场比赛。规则很简单：双方轮流说出单词，且不能重复说出之前已说过的单词。PolandBall 先开始。无法说出新单词的一方判负。

现给出 PolandBall 和 EnemyBall 各自熟悉的两个单词列表。若双方均采取最优策略，你能判断出谁将获胜吗？

The first input line contains two integers n and m (1 ≤ n, m ≤ 103) — number of words PolandBall and EnemyBall know, respectively.

Then n strings follow, one per line — words familiar to PolandBall.

Then m strings follow, one per line — words familiar to EnemyBall.

Note that one Ball cannot know a word more than once (strings are unique), but some words can be known by both players.

Each word is non-empty and consists of no more than 500 lowercase English alphabet letters.

第一行输入包含两个整数 $n$ 和 $m$（$1 \leq n, m \leq 10^3$），分别表示 PolandBall 和 EnemyBall 所掌握的单词数量。

接下来 $n$ 行，每行一个字符串 —— PolandBall 熟悉的单词。

再接下来 $m$ 行，每行一个字符串 —— EnemyBall 熟悉的单词。

注意：每个 Ball 不会重复掌握同一个单词（即所有字符串互不相同），但某些单词可能被两名玩家同时掌握。

每个单词非空，且仅由至多 500 个小写英文字母组成。

In a single line of print the answer — "YES" if PolandBall wins and "NO" otherwise. Both Balls play optimally.

在一行中输出答案——如果 PolandBall 获胜则输出 “YES”，否则输出 “NO”。两个球均采取最优策略。

In the first example PolandBall knows much more words and wins effortlessly.

In the second example if PolandBall says kremowka first, then EnemyBall cannot use that word anymore. EnemyBall can only say wiedenska. PolandBall says wadowicka and wins.

在第一个例子中，PolandBall 掌握的单词数量远超对手，因此轻松获胜。

在第二个例子中，如果 PolandBall 首先说出 kremowka，那么 EnemyBall 就不能再使用该单词了。EnemyBall 只能说出 wiedenska。随后 PolandBall 说出 wadowicka 并获胜。