402661: GYM100834 J Polycarp and Dividend

Polycarp have free time, collection of N decimal digits c₁, ... , c_N and positive integer A. He wants to find positive integer B, such that A divides B and B contains only digits from collection c₁, ... , c_N. Each digit from collection can be used any times. It is not required to use all the digits.

The first line contains N — the number of digits in collection, 1 ≤ N ≤ 10. The second line contains N integer numbers c_i (0 ≤ c_i ≤ 9). Each digit can be there at most one time. The third line contains integer A, 1 ≤ A ≤ 10⁵.

Output B. If you cannot find it, then output -1.

3
3 5 7
123

5535

1
1
1230

-1