B'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 xe2 x80 x99s sentences, Yash determined a new cipher technique. For a given sentence, the cipher is processed as: 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 xe2 x80 x89 xe2 x89 xa4 xe2 x80 x89n xe2 x80 x89 xe2 x89 xa4 xe2 x80 x8910 xe2 x80 x89000) -- 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 xe2 x80 x89 xe2 x89 xa4 xe2 x80 x89m xe2 x80 x89 xe2 x89 xa4 xe2 x80 x89100 xe2 x80 x89000) -- the number of words which will be considered while deciphering the text. Each of the next m lines contains a non-empty word wi (|wi| xe2 x80 x89 xe2 x89 xa4 xe2 x80 x891 xe2 x80 x89000) consisting of uppercase and lowercase English letters only. It 's guaranteed that the total length of all words doesn 't exceed 1 xe2 x80 x89000 xe2 x80 x89000. Print one line -- the original sentence. It is guaranteed that at least one solution exists. If there are multiple solutions, you may output any of those. In sample case 2 there may be multiple accepted outputs, "HI there HeLLo" and "HI there hello" you may output any of them. '...