#include <iostream>
#include <cstring>
using namespace std;

int b[200001];
int n, q;

int izracunaj ()
{
    int naj = 0, tmp = 0;
    for (int i=1; i<n; i++)
    {
        if (b[i] != b[i-1]) tmp++;
        else { naj = max(naj, tmp); tmp = 0;}
    }
    naj = max(naj, tmp);
    return naj+1;
}

int main()
{
    memset (b, 0, sizeof(b));
    scanf ("%d%d", &n, &q);
    int naj = 0;
    for (int i=0; i<q; i++)
    {
        int a; scanf ("%d", &a); a--;
        if (b[a] == 0) b[a] = 1;
        else           b[a] = 0;
        naj = 0;
        naj = max(naj, izracunaj());
        printf ("%d\n", naj);
    }
    //system ("PAUSE");
    return 0;
}