题

#include<bits/stdc++.h>
using namespace std;
long long n,m,k,s,g,a[1000000],l,p;
int main(){
	cin>>n>>m;
	k=m/2;
	if (n%m==0) p=n/m;
	else p=n/m+1;
	for (long long i=p-k;g<k;i++,g++){
		a[l++]=i;
		s+=i;
	}
	for (long long i=p;g<m;i++,g++){
		a[l++]=i;
		s+=i;
	}
	if(s==n){
		for (long long i=0;i<l;i++){
			cout<<a[i]<<" ";
		}
	}
	else{
		cout<<"-1";
	}
	return 0;
}