#include "books.h"
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define int ll
#define y1 zck_is_king
#define pii pair<int, int>
#define ull unsigned ll
#define f first
#define s second
#define ALL(x) x.begin(),x.end()
#define SZ(x) (int)x.size()
#define SQ(x) (x)*(x)
#define MN(a,b) a = min(a,(__typeof__(a))(b))
#define MX(a,b) a = max(a,(__typeof__(a))(b))
#define pb push_back
#define REP(i,n) for (int i = 0; i<n; ++i)
#define RREP(i,n) for (int i = n-1; i>=0; --i)
#define REP1(i,n) for (int i = 1; i<=n; ++i)
#define SORT_UNIQUE(c) (sort(c.begin(),c.end()), c.resize(distance(c.begin(),unique(c.begin(),c.end()))))
#ifdef BALBIT
#define IOS()
#define bug(...) fprintf(stderr,"#%d (%s) = ",__LINE__,#__VA_ARGS__),_do(__VA_ARGS__);
template<typename T> void _do(T &&x){cerr<<x<<endl;}
template<typename T, typename ...S> void _do(T &&x, S &&...y){cerr<<x<<", ";_do(y...);}
#else
#define IOS() ios_base::sync_with_stdio(0);cin.tie(0);
#define endl '\n'
#define bug(...)
#endif
const int iinf = 1e9+10;
const ll inf = 1e18;
const ll mod = 1e9+7 ;
void GG(){cout<<"0\n"; exit(0);}
ll mpow(ll a, ll n, ll mo = mod){ // a^n % mod
ll re=1;
while (n>0){
if (n&1) re = re*a %mo;
a = a*a %mo;
n>>=1;
}
return re;
}
ll inv (ll b, ll mo = mod){
if (b==1) return b;
return (mo-mo/b) * inv(mo%b,mo) % mo;
}
const int maxn = 1e5+5;
//using namespace std;
//
// --- Sample implementation for the task books ---
//
// To compile this program with the sample grader, place:
// books.h books_sample.cpp sample_grader.cpp
// in a single folder and run:
// g++ books_sample.cpp sample_grader.cpp
// in this folder.
//
void solve(signed N, signed K, long long A, signed S) {
// TODO implement this function
ll sums = 0;
vector<ll> ff(K+1);
REP1(i,K-1) {
sums += (ff[i] = skim(i));
}
int l = K, r = N+1;
while (l != r) {
int mid = (l+r)/2;
ll tmp = (mid > N ? inf : skim(mid));
if (tmp + sums >= A && tmp + sums <= 2*A) {
// good!
vector<signed> re;
REP1(i,K-1) re.pb(i);
re.pb(mid);
answer(re);
}
if (tmp + sums > 2*A) {
// bad
r = mid;
}else{
l = mid+1;
}
}
if (l == K) impossible();
ll now = sums + skim(l-1);
vector<signed> pos;
REP1(i,K-1) pos.pb(i);
pos.pb(l-1);
int at = SZ(pos)-2;
while (now < A && at >= 0) {
pos[at] = pos[at+1]-1;
now -= ff[at];
now += skim(pos[at]);
--at;
}
assert(now <= 2*A);
if (now < A) impossible();
answer(pos);
}
