A. Search for Pretty Integers

time limit per test

1 second

memory limit per test

256 megabytes

input

standard input

output

standard output

You are given two lists of non-zero digits.

Let's call an integer pretty if its (base 10) representation has at least one digit from the first list and at least one digit from the second list. What is the smallest positive pretty integer?

Input

The first line contains two integers n and m (1 ≤ n, m ≤ 9) — the lengths of the first and the second lists, respectively.

The second line contains n distinct digits a1, a2, ..., an (1 ≤ ai ≤ 9) — the elements of the first list.

The third line contains m distinct digits b1, b2, ..., bm (1 ≤ bi ≤ 9) — the elements of the second list.

Output

Print the smallest pretty integer.

Examples

input

2 3
4 2
5 7 6

output

25

input

8 8
1 2 3 4 5 6 7 8
8 7 6 5 4 3 2 1

output

1

Note

In the first example 25, 46, 24567 are pretty, as well as many other integers. The smallest among them is 25. 42 and 24 are not pretty because they don't have digits from the second list.

In the second example all integers that have at least one digit different from 9 are pretty. It's obvious that the smallest among them is 1, because it's the smallest positive integer.

解题说明：此题是一道模拟题，从两列数字中分别取一个数，找到组合起来最小的数字，遍历即可。

#include<cstdio>
#include<iostream>
#include<string>
#include<cstring>
#include<cmath>
using namespace std;

int main()
{
	int mas1[10];
	int mas2[10];
	int n, m, i, j, min = 100;
	scanf("%d %d", &n, &m);
	for (i = 0; i<n; i++) 
	{
		scanf("%d", &mas1[i]);
	}
	for (i = 0; i<m; i++) 
	{
		scanf("%d", &mas2[i]);
	}

	for (i = 0; i<n; i++) 
	{
		for (j = 0; j<m; j++)
		{
			if (mas1[i] == mas2[j] && mas1[i] < min)
			{
				min = mas1[i];
			}
			if (mas1[i] > mas2[j] && (mas2[j] * 10 + mas1[i]) < min)
			{
				min = (mas2[j] * 10 + mas1[i]);
			}
			if (mas1[i] < mas2[j] && (mas1[i] * 10 + mas2[j]) < min)
			{
				min = (mas1[i] * 10 + mas2[j]);
			}
		}
	}
	printf("%d\n", min);
	return 0;
}