#include <cstdio>
#include <cstring>
#include <algorithm>

const int NX = 200001;

int N, Q;
bool P[ NX ];

int main()
{
  scanf( "%d%d", &N, &Q );

  memset( P, 0, sizeof P );

  while( Q-- )
  {
    int x;
    scanf( "%d", &x );
    P[x] = !P[x];

    int cnt = 1;
    int sol = 0;

    for( int i = 2; i <= N; ++i )
    {
      if( P[i] != P[i-1] ) ++cnt;
      else cnt = 1;
      sol = std::max( sol, cnt );
    }

    printf( "%d\n", sol );
  }
}