#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <string>
#include <vector>
#include <algorithm>
#include <cmath>

using namespace std;

const int MAX = 200005;
bool k[MAX];
int n, q, x, curr, sol;

int main(void) {
	scanf("%d %d", &n, &q);
	for(int i = 0; i < q; ++i) {
		scanf("%d", &x);
		--x;
		k[x] = !k[x];
		curr = 1;
		sol = 0;
		for(int j = 1; j < n; ++j) {
			if (k[j - 1] != k[j]) ++curr; else curr = 1;
			if (curr > sol) sol = curr;

		}
		printf("%d\n", sol);
	}

	//system("pause");
	return 0;
}