#include <iostream>
#include <cstdio>
#include <cstring>
#include <cmath>
#include <string>
#include <vector>
#include <set>
#include <map>
#include <queue>
#include <stack>
#include <algorithm>

using namespace std;

int n, q, a, mx, res, tl, mn;

map< int, int > e;
map< int, int >::iterator low, up;
set< int > lens;

bool p[200010];

int main(){
    scanf( "%d%d", &n, &q );
    for( int i = 0; i < q; ++i ){
        scanf( "%d", &a ); --a;
        p[a] = !p[a];
        tl = res = 0;
        for( int j = 1; j < n; ++j ){
            if( p[j-1] != p[j] ) ++tl;
            else {
                res = max( res, tl );
                tl = 0;
            }
        }
        res = max( res, tl );
        printf( "%d\n", res+1 );
    }
	return 0;
}