#include<iostream>
#include<cstdio>
#include<vector>

#include<cstdlib>

using namespace std;

long int n, q;
bool p[200000] = {false};

long int vrijednost(void)
{
	long int max = -1;
	long int temp = 0;

	for(long int i = 0; i < n - 1; i++)
	{
		if(p[i] != p[i + 1])
			temp++;
		else 
		{
			if(max < temp)
				max = temp;

			temp = 0;
		}
	}

	if(max < temp)
		max = temp;

	return max + 1;
}

int main (void)
{
	vector<long int> rj;

	scanf("%ld%ld", &n, &q);
	for(long int i = 0; i < q; i++)
	{
		long int k;
		scanf("%ld", &k);
		p[k - 1] = !p[k - 1];
		
		rj.push_back(vrijednost());
	}

	for(long int i = 0; i < q; i++)
	{
		printf("%ld\n", rj[i]);
	}
	
	return 0;
}