#include <cstdio>
#include <iostream>

using namespace std;

const int MaxN = 200005;

int n, Q, a[ MaxN ], M, len, sol;

bool s[ MaxN ], K;

int main( void ) {
    scanf( "%d%d", &n, &Q );
    for( int i = 0; i < Q; ++i ) {
        scanf( "%d", &a[ i ] );
        s[ a[ i ] ] = s[ a[ i ] ]^1;
        len = 1;
        sol = 0;
        M = max( M, a[ i ] );
        for( int j = 2; j <= M+1 && j <= n; ++j ) {
            if( s[ j ] != s[ j-1 ] )
                ++len;
            else {
                sol = max( len, sol );
                len = 1;
            }
        }
        sol = max( sol, len );
        printf( "%d\n", sol );
    }
    return 0;
}