Beautiful number

Input

The first line contains two integers $n$ and $m$ $(1 \leq n, m \leq 9)$ (1 \le n, m \le 9) - the sizes of the first and second sets. The second line contains $n$ distinct digits $d_{1}, d_{2}, \dots, d_{n}$ d_1, d_2, \ldots, d_n. The third line contains $m$ distinct digits $r_{1}, r_{2}, \dots, r_{m}$ r_1, r_2, \ldots, r_m $(1 \leq d_{i}, r_{i} \leq 9)$ (1 \le d_i, r_i \le 9).

Output

Print the smallest beautiful number.

Examples

In the example, there are such beautiful numbers as $13$ , $18$ , $3451$ and so on. The smallest of them is $13$ .

Example 1

Loading