#include<cstdio>

#include<iostream>

#include<cstring>

#include<cctype>

#include<algorithm>

using namespace std;

#define int long long

#define olinr return

#define _ 0

#define love_nmr 0

#define DB double

bool turn[];

struct node

{

    node *ls;

    node *rs;

    int lmax;

    int rmax;

    int mmax;

    int l;

    int r;

    int len;

};

int n;

int m;

inline int read()

{

    int x=,f=;

    char ch=getchar();

    while(!isdigit(ch))

    {

        if(ch=='-')

            f=-f;

        ch=getchar();

    }

    while(isdigit(ch))

    {

        x=(x<<)+(x<<)+(ch^);

        ch=getchar();

    }

    return x*f;

}

inline void put(int x)

{

    if(x<)

    {

        x=-x;

        putchar('-');

    }

    if(x>)

        put(x/);

    putchar(x%+'');

}

inline void push_up(node *now,int pos)

{

    now->lmax=now->ls->lmax;                                      //最起码当前区间的lmax也得等于左儿子的lmax

    if(turn[pos]!=turn[pos+]&&now->lmax==(now->ls->len))         //看左孩子右端和右孩子左端是否能接上&&lmax刚好为区间长度（全符合）

        now->lmax+=now->rs->lmax;                                 //接上

    now->rmax=now->rs->rmax;                                      //右孩子同理

    if(turn[pos]!=turn[pos+]&&now->rmax==(now->rs->len))

        now->rmax+=now->ls->rmax;

    now->mmax=max(now->ls->mmax,now->rs->mmax);                   //中间的先去max

    if(turn[pos]!=turn[pos+])

        now->mmax=max(now->mmax,now->ls->rmax+now->rs->lmax);     //考虑接上的情况

}

inline void build(node *now,int l,int r)

{

    now->l=l;

    now->r=r;

    now->lmax=;

    now->rmax=;

    now->mmax=;

    now->len=now->r-now->l+;

    if(l==r)

    {

        now->lmax=;

        now->rmax=;  //最短为1

        now->mmax=;

        return;

    }

    int mid=(l+r)>>;

    now->ls=new node();

    now->rs=new node();

    build(now->ls,l,mid);

    build(now->rs,mid+,r);

    push_up(now,mid);

}

inline void lazy(node *now,int k)

{

    if(now->l>k||now->r<k) return;

    if(now->l==k&&now->r==k)

    {

        turn[now->l]^=;   //到达叶子直接更新

        return;

    }

    lazy(now->ls,k);

    lazy(now->rs,k);

    push_up(now,(now->l+now->r)>>);

}

signed main()

{

    n=read();

    m=read();

    node *root=new node();

    build(root,,n);

    while(m--)

    {

        lazy(root,read());

        put(max(root->lmax,max(root->rmax,root->mmax)));   //根（全序列）取max

        putchar('\n');

    }

    olinr ~~(^_^)+love_nmr;

}