Cartonase2

#include <iostream>
#include <algorithm>
using namespace std;
int n,i,v[1001],ult,r,m;
int main()
{
    cin>>n>>m;
    n=n-m;
    for (i=1; i<=n; i++)
        cin>>v[i];
    sort (v+1,v+n+1);
    ult=v[1];
    r=(v[n]-v[1])/(n+m-1);
    for (i=1; i<=n; i++)
    {
        if (v[i]!=ult)
        {
            cout<<ult<<' ';
            i--;
        }
        ult+=r;
    }
    return 0;
}