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.

Input
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.

Output
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.

Sample Input
Input
4 2 3
1 2
2 3 4
Output
1 1 2 2
Input
5 5 2
3 4 1 2 5
2 3
Output

1 1 1 1 1

//刚开始以为是动态规划的题，没想到一般思路更简单……

#include<cstdio>
#include<cstring>
#include<algorithm>
#include<iostream>
int a[105];
using namespace std;
int main()
{
	int n,x,y,i,j;
	scanf("%d%d%d",&n,&x,&y);
	
		for(i=1;i<=n;i++)
			a[i]=0;
		for(i=1;i<=x;i++)
		{
			scanf("%d",&j);
			if(a[j]==0)
			{
				a[j]=1;
			}
		}
		for(i=1;i<=y;i++)
		{
			scanf("%d",&j);
			if(a[j]==0)
			{
				a[j]=2;
			}
		}
		
		for(i=1;i<=n-1;i++)
		{
			printf("%d ",a[i]);
		}
		printf("%d\n",a[i]);
	
	return 0;
}