After observing the results of Spy Syndrome, Yash realised the errors of his ways. He now believes that a super spy such as Siddhant can't use a cipher as basic and ancient as Caesar cipher. After many weeks of observation of Siddhant’s sentences, Yash determined a new cipher technique.

For a given sentence, the cipher is processed as: 
 1.  Convert all letters of the sentence to lowercase. 1.  Reverse each of the words of the sentence individually. 1.  Remove all the spaces in the sentence. 
For example, when this cipher is applied to the sentence

Kira is childish and he hates losing

the resulting string is

ariksihsidlihcdnaehsetahgnisol

Now Yash is given some ciphered string and a list of words. Help him to find out any original sentence composed using only words from the list. Note, that any of the given words could be used in the sentence multiple times.
The first line of the input contains a single integer *n* (1 ≤ *n* ≤ 10 000) — the length of the ciphered text. The second line consists of *n* lowercase English letters — the ciphered text *t*.

The third line contains a single integer *m* (1 ≤ *m* ≤ 100 000) — the number of words which will be considered while deciphering the text. Each of the next *m* lines contains a non-empty word *w*<sub class="lower-index">*i*</sub> (|*w*<sub class="lower-index">*i*</sub>| ≤ 1 000) consisting of uppercase and lowercase English letters only. It's guaranteed that the total length of all words doesn't exceed 1 000 000.
In sample case 2 there may be multiple accepted outputs, "HI there HeLLo" and "HI there hello" you may output any of them.
30
ariksihsidlihcdnaehsetahgnisol
10
Kira
hates
is
he
losing
death
childish
L
and
Note
Kira is childish and he hates losing 
12
iherehtolleh
5
HI
Ho
there
HeLLo
hello
HI there HeLLo 
71
baaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa
8
a
aa
aaa
aaaa
aaaaa
aaaaaa
aaaaaaa
aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaab
aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaab 
11
aaaaaaaaaaa
3
aaaa
aaaaa
aaaaaa
aaaaaa aaaaa 
5
cbaed
6
bc
ea
ab
cd
abc
de
abc de 
5
lehet
3
el
hel
te
hel te 
3
aab
2
a
baa
baa 
3
aab
2
aa
baa
baa 
9
aaaaaaaaa
2
aa
aaa
aaa aa aa aa 
7
abababc
2
ba
cba
ba ba cba 
7
kirkirk
2
rik
krik
rik krik 
n = int(input())
s = input()
s = s[::-1]
m = int(input())
kod = ''

for i in range(m):
    r = input()
    l = r.lower()

    if l in s and len(l) > 1:
        kod += r
        kod += ' '

print(kod)
