#include "books.h"
#include <map>
#include <vector>
using namespace std;

void solve(int N,int K,long long A,int S){
	using ll=long long;
	auto ask=[](int x){
		static map<int,ll> h;
		auto it=h.find(x);
		if(it==h.end())
			it=h.insert({x,skim(x)}).first;
		return it->second;
	};
	int p;
	{
		int l=1,r=N+1;
		while(l^r){
			int m=(l+r)>>1;
			if(ask(m)>=A)
				r=m;
			else
				l=m+1;
		}
		p=r;
	}
	ll s=0;
	for(int i=1;i<=K;++i)
		s+=ask(i);
	if(s>A*2)
		return impossible();
	if(s>=A){
		vector<int> ans;
		for(int i=1;i<=K;++i)
			ans.push_back(i);
		return answer(ans);
	}
	if(K<=p && p<=N && s-ask(K)+ask(p)<=A*2){
		vector<int> ans;
		for(int i=1;i<K;++i)
			ans.push_back(i);
		ans.push_back(p);
		return answer(ans);
	}
	if(K<p){
		for(int i=1;i<=K;++i){
			s+=ask(p-i)-ask(K-i+1);
			if(A<=s && s<=A*2){
				vector<int> ans;
				for(int j=1;j<=K-i;++j)
					ans.push_back(j);
				for(int j=p-i;j<p;++j)
					ans.push_back(j);
				return answer(ans);
			}
		}
	}
	return impossible();
}