#include <iostream>
#include <cstdio>
#include <string>
#include <algorithm>
#include <vector>
#include <math.h>
#include <queue>

using namespace std;

vector<bool> c(0);
vector<int> p(0);
int n, q;

int prv = 0, prs = 0, pre = 0;
int GetValue(int crcp) {
	int crv = 0, crs = crcp, cre = crcp;
	c[crcp] = !c[crcp];

	while(crs > 0 && c[crs] != c[crs - 1]) {
		crs--; crv++;
	}
	while(cre < n - 1 && c[cre] != c[cre + 1]) {
		cre++; crv++;
	}

	if (crv > prv) {
		prv = crv;
		prs = crs;
		pre = cre;
	}

	return prv;
}

int main() {
	cin >> n >> q;
	c.resize(n);
	for(int i = 0; i < q; ++i) {
		int tmp; cin >> tmp;
		p.push_back(tmp);
	}
		
	for(int i = 0; i < q; ++i) {
		cout << GetValue(p[i] - 1) << endl;
	}

	return 0;
}