Codeforces Round #532 (Div. 2)- B（思维）

Arkady coordinates rounds on some not really famous competitive programming platform. Each round features nn problems of distinct difficulty, the difficulties are numbered from 11 to nn.

To hold a round Arkady needs nn new (not used previously) problems, one for each difficulty. As for now, Arkady creates all the problems himself, but unfortunately, he can't just create a problem of a desired difficulty. Instead, when he creates a problem, he evaluates its difficulty from 11 to nn and puts it into the problems pool.

At each moment when Arkady can choose a set of nn new problems of distinct difficulties from the pool, he holds a round with these problems and removes them from the pool. Arkady always creates one problem at a time, so if he can hold a round after creating a problem, he immediately does it.

You are given a sequence of problems' difficulties in the order Arkady created them. For each problem, determine whether Arkady held the round right after creating this problem, or not. Initially the problems pool is empty.

Input

The first line contains two integers nn and mm (1≤n,m≤1051≤n,m≤105) — the number of difficulty levels and the number of problems Arkady created.

The second line contains mm integers a1,a2,…,ama1,a2,…,am (1≤ai≤n1≤ai≤n) — the problems' difficulties in the order Arkady created them.

Output

Print a line containing mm digits. The ii-th digit should be 11 if Arkady held the round after creation of the ii-th problem, and 00 otherwise.

Examples

input

Copy

3 11
2 3 1 2 2 2 3 2 2 3 1

output

Copy

00100000001

input

Copy

4 8
4 1 3 3 2 3 3 3

output

Copy

00001000

Note

In the first example Arkady held the round after the first three problems, because they are of distinct difficulties, and then only after the last problem.

思路：一开始理解错题意了，以前剩下的题目也要算在后边，故可以用标记数组的量来检测

代码：

#include<cstdio>
#include<iostream>
#include<algorithm>
#include<cstring>

using namespace std;
int vis[100005],a[100005];
int main()
{

	int n,m;
	cin>>n>>m;
	int sum=0;
	for(int t=0;t<m;t++)
	{
		scanf("%d",&a[t]);
		if(vis[a[t]]==0)
		{
			sum++;

		}
		vis[a[t]]++;

		if(sum==n)
		{
			printf("1");
			sum=0;
			for(int j=1;j<=n;j++)
			{
				vis[j]--;
				if(vis[j]>0)
				{
				sum++;	

				}
			}

		}
		else if(sum<n)
		{
			printf("0");
		}

	}
	return 0;
}