#include <bits/stdc++.h>
#include "books.h"
using namespace std;
#define pb push_back
#define sz(a) (int)a.size()
#define all(a) begin(a),end(a)
using ll = long long;
using vi = vector<int>;
const int N = (int)1e5+10;
int n;
ll a[N];
ll Skim(int i){
if(a[i]!=-1) return a[i];
return a[i]=skim(i);
}
ll sum(int mid, int num){
ll s = 0;
for(int j = mid; j < mid+num; j++) s+=Skim(j);
return s;
}
void solve(int _N, int K, ll A, int S) {
n = _N; memset(a,-1,sizeof(a));
int l = 1, r = n-K+1;
while(l<r){
int mid = (l+r)/2;
ll xd = sum(mid,K);
if(xd>=A and xd<=2*A){
vi ans(K,0); iota(all(ans),mid); answer(ans);
return;
}
if(xd>2*A) r=mid-1;
else l=mid+1;
}
ll xd = sum(l,K);
if(xd>=A and xd<=2*A){
vi ans(K,0); iota(all(ans),l); answer(ans);
return;
}
l = 1, r = n-K+1;
while(l<r){
int mid = (l+r)/2;
ll xd = sum(mid,K-1);
vi ans(K,0); iota(all(ans),mid);
if(xd<A){
int l2 = mid+K, r2 = n;
while(l2<r2){
int mid2 = (l2+r2+1)/2;
ll nsum = xd+Skim(mid2);
if(nsum>=A and nsum<=2*A){
ans[K-1] = mid2; answer(ans); return;
}
if(nsum>2*A) r2=mid-1;
else l2=mid;
}
}
if(xd>2*A) r=mid-1;
else l=mid+1;
}
impossible();
}
