//chockolateman
#include<bits/stdc++.h>
#include"books.h"
using namespace std;
long long a[100005];
void solve(int N,int K,long long A,int S)
{
long long l = 1;
long long r = N;
for(long long i = 1 ; i <= min(N,10) ; i++)
a[i] = skim(i);
long long sum_l = 0;
vector<int> ret;
for(long long i = 1 ; i <= K ; i++)
sum_l += a[i];
if(sum_l > 2*A)
impossible();
else if(A <= sum_l && sum_l <= 2*A)
{
for(long long i = 1 ; i <= K ; i++)
ret.push_back(i);
}
else
{
while(l < r - 1) //searching for first val >= A
{
long long mid = (l + r + 1)/2;
if(!a[mid])
a[mid] = skim(mid);
if(a[mid] < A)
l = mid + 1;
else if(a[mid])
r = mid;
}
if(l==r-1)
{
if(!a[l])
a[l] = skim(l);
if(a[l] >= A)
r = l;
}
if(!a[r])
a[r] = skim(r);
long long sum_temp = sum_l - a[K] + a[r];
if(sum_temp > 2*A || sum_temp < A)
{
if(sum_temp > 2*A)
r--;
long long sum_r = 0;
for(long long i = r ; i >= max(r - K + 1,1ll) ; i--)
{
if(!a[i])
a[i] = skim(i);
sum_r += a[i];
}
if(sum_r < A)
impossible();
long long cur_sum = sum_l;
long long pos = 0;
for(long long j = 1 ; j <= K ; j++)
{
sum_l += a[r - j + 1] - a[K - j + 1];
if(A <= sum_l && sum_l <= 2*A)
{
pos = j;
}
}
for(long long i = 1 ; i <= K - pos ; i++)
ret.push_back(i);
for(long long i = r - pos + 1 ; i <= r ; i++)
ret.push_back(i);
}
else
{
for(long long i = 1 ; i < K ; i++)
ret.push_back(i);
ret.push_back(r);
}
}
answer(ret);
}
