Today Ave is learning number matching. Basically, what happens is that Alice gives Ave n random numbers and tells him to store these numbers. But that is not the only task Alice had given to Ave. Now Alice gives Ave some special numbers and tells Bob to return those numbers in his database which have prefix matching to the special numbers. Remember if there exists a number which is equal to the special number, Ave should not return it(See example to be more clear about it). Can you write this program, so that Ave has one more ability in his arsenal.

Input:

First line contains the number of random numbers, n

Second line would contain n space separated integers A₁, A₂, ..., A_n.

Third line would contain number k, the number of special numbers.

Next k lines would contain integers B₁, B₂, ..., B_k denoting the special numbers.

Output:

Print k lines. In each line, there should be space separated numbers denoting the numbers matched with the special number. If there are no such numbers for the B_i. print "No match".

Please note that numbers should be printed in lexicographical order.

Constraints:

1 ≤ n ≤ 10⁴

1 ≤ A_i ≤ 10²⁰

1 ≤ k ≤ 10⁴

1 ≤ B_i ≤ 10²⁰