#include<bits/stdc++.h>
#include "books.h"
#define fr(i,x,y) for(register int i=(x);i<=(y);i++)
using namespace std;
long long a[100010],pos=0;
vector<int> ans;
bool solve1(int n,int k,long long A){
	int l=1,r=n+1;
	a[n+1]=1e18;
	long long sum;
	while(l<r){
		int mid=(l+r)>>1;
		if(!a[mid]) a[mid]=skim(mid);
		if(a[mid]>=A) r=mid;
		else l=mid+1;
	}
	pos=l;
	if(l>n) return 0;
	sum=a[l];
	fr(i,1,k-1) sum+=a[i];
	if(sum<=2*A){
		fr(i,1,k-1) ans.push_back(i);
		ans.push_back(l);
		answer(ans);
		return 1;
	} 
	return 0;
}
bool solve2(int n,int k,long long A){
	pos--;
	if(pos<=2*k){
		fr(i,k+1,pos) a[i]=skim(i);
		fr(i,1,pos-k+1){
			long long sum=0;
			fr(j,i,i+k-1) sum+=a[j];
			if(sum>=A&&sum<=2*A){
				fr(j,i,i+k-1) ans.push_back(j);
				answer(ans);
				return 1;
			}
		}
		return 0;
	}
	fr(i,pos-k+1,pos) a[i]=skim(i);
	long long sum=0;
	fr(i,1,k) sum+=a[i];
	if(sum>2*A) return 0;
	sum=0;
	fr(i,pos-k+1,pos) sum+=a[i];
	if(sum<A) return 0;
	sum=0;
	fr(i,1,k) sum+=a[i];
	fr(i,1,k){
		if(sum>=A&&sum<=2*A){
			fr(j,i,k) ans.push_back(j);
			fr(j,pos-k+1,pos-k+i-1) ans.push_back(j);
			answer(ans);
			return 1;
		}
		sum+=a[pos-k+i]-a[i];
	}
	if(sum>=A&&sum<=2*A){
		fr(i,pos-k+1,pos) ans.push_back(i);
		answer(ans);
		return 1;
	}
	return 0;
}
void solve(int n,int k,long long A,int limit){
	fr(i,1,k) a[i]=skim(i);
	if(solve1(n,k,A)) return;
	if(solve2(n,k,A)) return;
	impossible();
}
//#include "sample_grader.cpp"