#include <iostream>
#include <cstdio>
#include <cstring>
using namespace std;
int n,q,a[200001],b,tr,mx;
int main(){
	cin>>n>>q;
	for (int i=0; i<q; ++i){
	    mx=0;
	    cin>>b;
	    a[b-1]=!a[b-1];
	    tr=1;
	    for (int j=1; j<=n; ++j){
	        if (a[j]==a[j-1]||j==n){ mx=max(tr,mx); tr=1;}
	        else ++tr;
	        //cout<<tr<<" ";
	    }
	    cout/*<<endl*/<<mx<<endl;
	}
	return 0;
}