Reality

Život na kavi is a popular reality show in which members of parliament compete. The contestants are split into a red team and a black team, and each week a set number of contestants is eliminated from the show.

The jury decides who leaves. Each jury member writes on a separate sheet of paper the name of exactly one contestant who should stay in the show, and the name of exactly one contestant who should leave. The jurors are corrupt, so the two names on the same sheet never belong to members of the same team.

A jury member is happy if both of their wishes come true: the contestant they wanted to stay is still in the show at the end of the week, and the contestant they wanted eliminated is eliminated. Choose the set of contestants to eliminate so that the number of happy jury members is as large as possible.

The first line contains a natural number $n$ ($1 \le n \le 250$), the number of members of the red team. The next $n$ lines each contain the name of one red team member.

The next line contains a natural number $m$ ($1 \le m \le 250$), the number of members of the black team. The next $m$ lines each contain the name of one black team member.

The next line contains a natural number $k$ ($1 \le k \le 1000$), the number of jury members. The next $k$ lines each contain two names separated by a space. The first name is the contestant the jury member wants to stay, and the second is the contestant they want to leave.

All names are distinct and consist of at most 10 lowercase English letters.

On the first line, print the number $x$ of contestants who leave the show. On each of the next $x$ lines, print the name of one leaving contestant, in any order.