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

using namespace std;
const int maxn=200020;
int n,q,kor[maxn],a,maxu[maxn];

int obrni(int a){
        return 1-a;
}

int provjeri(void){
    int k=1;
    int maxk=0;
    for (int i=0;i<n;i++){
        if (obrni(kor[i])==kor[i-1]){
                k++;
        }
        else{
            maxk=max(maxk,k);
            k=1;
        }
    }
    maxk=max(maxk,k);
    return maxk;
}

int main (void){
    cin >> n >> q;
    memset(kor,0,sizeof kor);
    for (int i=0;i<q;i++){
            cin >> a;
            kor[a-1]=obrni(kor[a-1]);
            maxu[i]=provjeri();
    }
    for (int i=0;i<q;i++){
            cout << maxu[i] << endl;
    }
    return 0;
}