#include<cstdio>
#include<vector>
#include<map>
using namespace std;
long long skim(int i);
void answer(vector<int> v);
void impossible();
void solve(int N,int K,long long A,int S)
{
	int l=1,r=N+1,mid;
	static long long mp[100001]={},v[30]={},pl[30],num=K,sum=0;
	while(l+1<r)
	{
		mid=l+r>>1;
		long long vp=mp[mid]=skim(mid);
		if(vp<=A)l=mid;
		else r=mid;
	}
	for(int i=1;i<=K;++i)
	{
		pl[i]=i;
		if(mp[i])v[i]=mp[i];
		else v[i]=skim(i);
		sum+=v[i];
	}
	if(A+A<sum)
	{
		impossible();return;
	}
	if(A<=sum&&sum<=A+A)
	{
		vector<int>v;v.reserve(K);
		for(int i=1;i<=K;++i)v.push_back(i);
		answer(v);return;
	}
	if(l<N&&l>=K)
	{
		if(!mp[l+1])mp[l+1]=skim(l+1);
		if(sum-v[K]+mp[l+1]<=A+A)
		{
			vector<int>v;v.reserve(K);
			for(int i=1;i<K;++i)v.push_back(i);
			v.push_back(l+1);
			answer(v);return;
		}
	}
	for(int i=(K>l-K?K:l-K)+1;i<=l;++i)
	{
		pl[++num]=i;
		if(mp[i])v[num]=mp[i];
		else v[num]=skim(i);
		sum+=v[num]-v[num-K];
		if(A<=sum&&sum<=A+A)
		{
			vector<int>v;v.reserve(K);
			for(int j=num-K+1;j<=num;++j)v.push_back(pl[j]);
			answer(v);return;
		}
	}
	impossible();
}