#include <iostream>
#include <map>
using namespace std;
int main() {
int x,n;
cin>>x>>n;
int a[n];
int pos[x+1] = {0};
pos[0]=1;
pos[x]=1;
for(int i=0;i<n;i++)
{
cin>>a[i];
pos[a[i]]=1;
int prev = 0;
int maxi =0;
for(int i=0;i<=x;i++)
{
if(pos[i] == 1)
{
maxi = max(maxi,i-prev);
prev = i;
}
}
cout<<maxi<<endl;
}
return 0;
}
I2luY2x1ZGUgPGlvc3RyZWFtPgojaW5jbHVkZSA8bWFwPgp1c2luZyBuYW1lc3BhY2Ugc3RkOwoKaW50IG1haW4oKSB7CgoJaW50IHgsbjsKCWNpbj4+eD4+bjsKCQoJaW50IGFbbl07CglpbnQgcG9zW3grMV0gPSB7MH07Cglwb3NbMF09MTsKCXBvc1t4XT0xOwoJZm9yKGludCBpPTA7aTxuO2krKykKCXsKCQljaW4+PmFbaV07CgkJcG9zW2FbaV1dPTE7CgkJaW50IHByZXYgPSAwOwoJCWludCBtYXhpID0wOwoJCWZvcihpbnQgaT0wO2k8PXg7aSsrKQoJCXsKCQkJaWYocG9zW2ldID09IDEpCgkJCXsKCQkJCW1heGkgPSBtYXgobWF4aSxpLXByZXYpOwoJCQkJcHJldiA9IGk7CgkJCX0KCQl9CgkJY291dDw8bWF4aTw8ZW5kbDsKCX0KCgoJcmV0dXJuIDA7Cn0=