M. Choosing a name
time limit per test
1 second
memory limit per test
256 megabytes
input
standard input
output
standard output

Igor and Ira are waiting for their family to grow; they will be young parents very soon. The most important question at the moment is how to name the baby.

Igor and Ira argued for a long time about naming the unborn child, but they could not agree. Then they decided to make lists of names that they liked and disliked.

Igor has a list of $$$n_1$$$ names that he likes and a list of $$$m_1$$$ names that Igor does not like. Ira made lists of $$$n_2$$$ names that she likes and $$$m_2$$$ names that she doesn't like. Igor and Ira will choose a name for the future child, such that both have it in the lists of names that they like and no one has it in the lists of names that they don't like.

Help Igor and Ira to determine the names they can use to name the unborn child. Output a possible list of names in lexicographical order.

Input

In the first line are given $$$4$$$ integer numbers $$$n_1$$$, $$$n_2$$$, $$$m_1$$$, $$$m_2$$$ $$$(1 \leq n_1,n_2 \leq 10^3, 0\leq m_1,m_2\leq 10^3)$$$ – the number of names that Igor likes, names that Ira likes, names that Igor doesn't like, names that Ira doesn't like.

All names consist of small Latin letters that are no longer than $$$20$$$ digits. Some names can be repeated in the same list.

Output

Output all names that Igor and Ira like in alphabetical order without repeating the names.

Example
Input
5 4 2 3
kirill
ruslan
sonya
veronika
vasya
ruslan
alina
sonya
veronika
nastya
masha
sasha
masha
natasha
Output
ruslan
sonya
veronika