#include <iostream>

using namespace std;

int n, q;
int temp;

bool a[200000];

int longest() {
    int koliko = 1;
    int najduzi = 0;
    for (int i = 0; i < n - 1; i++) {
        koliko = 1;
        for (int j = i; a[j] == !a[j + 1] && j < n; j++)
            koliko++;
            
        if (koliko > najduzi)
           najduzi = koliko;
    }   
    return najduzi;       
}

int main() {
    cin>>n >>q;
    for (int i = 0; i < q; i++) {
        cin>>temp;
        a[temp] = !a[temp];
        cout<<longest()<<endl;    
    }
        
    
    
    
    int asdf;
    cin>>asdf;
}