CF421A.Pasha and Hamsters

Pasha has two hamsters: Arthur and Alexander. Pasha put n apples in front of them. Pasha knows which apples Arthur likes. Similarly, Pasha knows which apples Alexander likes. Pasha doesn't want any conflict between the hamsters (as they may like the same apple), so he decided to distribute the apples between the hamsters on his own. He is going to give some apples to Arthur and some apples to Alexander. It doesn't matter how many apples each hamster gets but it is important that each hamster gets only the apples he likes. It is possible that somebody doesn't get any apples.

Help Pasha distribute all the apples between the hamsters. Note that Pasha wants to distribute all the apples, not just some of them.

帕沙有两只仓鼠：阿瑟和亚历山大。帕沙把 $n$ 个苹果放在它们面前。帕沙知道阿瑟喜欢哪些苹果，同样也知道亚历山大喜欢哪些苹果。帕沙不希望仓鼠之间发生冲突（因为它们可能喜欢同一个苹果），因此他决定亲自将苹果分给这两只仓鼠。他打算将其中一些苹果分给阿瑟，另一些分给亚历山大。每只仓鼠分得的苹果数量无关紧要，但重要的是：每只仓鼠只能得到它喜欢的苹果。有可能某只仓鼠一个苹果也分不到。

请帮助帕沙将所有苹果分给这两只仓鼠。注意：帕沙希望分完全部苹果，而不仅仅是其中一部分。

The first line contains integers n, a, b (1 ≤ n ≤ 100; 1 ≤ a, b ≤ n) — the number of apples Pasha has, the number of apples Arthur likes and the number of apples Alexander likes, correspondingly.

The next line contains a distinct integers — the numbers of the apples Arthur likes. The next line contains b distinct integers — the numbers of the apples Alexander likes.

Assume that the apples are numbered from 1 to n. The input is such that the answer exists.

第一行包含三个整数 $n$、$a$、$b$（$1 \leq n \leq 100$；$1 \leq a, b \leq n$），分别表示帕沙拥有的苹果总数、亚瑟喜欢的苹果数量以及亚历山大喜欢的苹果数量。

第二行包含 $a$ 个互不相同的整数——亚瑟喜欢的苹果编号。
第三行包含 $b$ 个互不相同的整数——亚历山大喜欢的苹果编号。

假设苹果编号为 $1$ 到 $n$。输入数据保证答案存在。

Print n characters, each of them equals either 1 or 2. If the i-h character equals 1, then the i-th apple should be given to Arthur, otherwise it should be given to Alexander. If there are multiple correct answers, you are allowed to print any of them.

输出 n 个字符，每个字符为 1 或 2。若第 i 个字符为 1，则第 i 个苹果应分给 Arthur；否则（即该字符为 2），则第 i 个苹果应分给 Alexander。若存在多个正确答案，输出任意一个即可。