Beautiful name

Problem Description

Fayoza says that some letters in the alphabet are more beautiful than others. Also, she claims that some names are more beautiful than others.

You are given a set of beautiful letters. The beauty of a name equals the count of beautiful letters in the name. Among a list of $n$ names, find the most beautiful one. If there are ties, print the one that appears first in the list.

Input Format

The first line contains an integer $n$ --- the number of names.

The second line contains a string --- the set of beautiful letters. All letters are lowercase English letters.

Each of the next $n$ lines contains a string --- the names. All names consist of lowercase English letters.

Constraints:

$1 \leq n \leq 10\,000$

$|t| \leq 26$, where $t$ is the set of beautiful letters.

$sL \leq 2 \cdot 10^5$, where $sL$ is the total length of all names.

Output Format

On a single line, print the most beautiful name. If there are ties, print the one that appears earlier in the list.

Scoring

Notes

In the first sample, the beautiful letters are "a", "f", and "s". The beauties are: "malika" $= 2$, "fayoza" $= 3$, "gulrux" $= 0$, "asila" $= 3$. Both "fayoza" and "asila" have beauty $3$, but "fayoza" appears first, so the answer is "fayoza".

In the second sample, both "hello" and "world" have beauty $0$.

4
afs
malika
fayoza
gulrux
asila

fayoza

2
a
hello
world

hello