#include <iostream>
#include <string>
#include <vector>
#include <set>
#include <cstring>
#include <map>

       
using namespace std;

    int n,q;

    bool k[200005];

        
int main() {
    cin >> n >> q;
    
    memset(k,0,sizeof k);
    
    
    int i,j;
    
    for(i=0; i<q; i++) {
        int t; cin >> t; t--;
        
        k[t] = !k[t];
        
        int mk = 0;
        bool s = k[0]; int m = 1;
        for(j=0; j<n-1; j++) {
            if(k[j+1] == (!k[j])) m++;
            else { if(m > mk) { mk = m; m = 1; } }
        }
         
        if(m > mk) { mk = m; m = 1; }   
        cout << mk << endl;
         }
        
        
    //system("pause");
}