int main()
{
    ios_base::sync_with_stdio(false); 
    cin.tie(NULL);
    long long n,x;
    cin>>x>>n;
    multiset<long long> mul;
    vector<long long> p;
    p.push_back(0);
    p.push_back(x);
    vector<long long> q(n+1),ans(n+1);
    for(long long i=0;i<n;i++)
    {
      long long val;
      cin>>val;
      p.push_back(val);
      q[i+1]=val;
    }
    sort(p.begin(),p.end());
    map<long long,long long> fwd,bk;
    long long sz=p.size();
    fwd[0]=p[1];
    bk[x]=p[sz-2];
    for(long long i=1;i<=(sz-2);i++)
    {
      fwd[p[i]]=p[i+1];
      bk[p[i]]=p[i-1];
    }
    for(long long i=1;i<=(sz-1);i++)
    {
      mul.insert(p[i]-p[i-1]);
    }
    for(long long i=n;i>=1;i--)
    {
      ans[i]=*mul.rbegin();
      long long val=q[i];
      mul.erase(fwd[val]-val);
      mul.erase(val-bk[val]);
      mul.insert(fwd[val]-bk[val]);
      long long a=fwd[val];
      long long b=bk[val];
      bk[a]=b;
      fwd[b]=a;
    }
    for(long long i=1;i<=n;i++)
    {
      cout<<ans[i]<<" ";
    }
    cout<<'\n';
    return 0;
}