#include "books.h"
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define fi first
#define se second
#define pb push_back
#define vi vector<int>
#define vl vector<ll>
#define pi pair<int, int>
#define pl pair<ll,ll>
#define all(x) (x).begin(),(x).end()
void solve(int n, int k, ll a, int s) {
if (n==s) {
vl vals(n);
for (int i=0; i<n; i++) {
vals[i]=skim(i+1);
}
for (int i=0; i<=n-k; i++) {
ll s=accumulate(vals.begin()+i,vals.begin()+i+k,0ll);
if (a<=s && s<=2*a) {
vi inds(k);
iota(all(inds),i+1);
answer(inds);
}
}
for (int i=k; i<n; i++) {
ll s=accumulate(vals.begin(),vals.begin()+k-1,0ll)+vals[i];
if (a<=s && s<=2*a) {
vi inds(k);
iota(all(inds),1);
inds[k-1]=i+1;
answer(inds);
}
}
for (int i=n-k; i>=0; i--) {
ll s=accumulate(vals.end()-k+1,vals.end(),0ll)+vals[i];
if (a<=s && s<=2*a) {
vi inds(k);
iota(all(inds),n-k+2);
inds[k-1]=i+1;
answer(inds);
}
}
/*for (int i=0; i<n; i++) {
for (int j=i+1; j<n; j++) {
ll sum=vals[i]+vals[j];
int ind=lower_bound(vals.begin(),vals.end(),a-sum)-vals.begin();
if (ind<=j) {
ind=j+1;
}
if (ind>n) {
continue;
}
if (a<=sum+vals[ind] && sum+vals[ind]<=2*a) {
answer({i+1,j+1,ind+1});
}
}
}*/
impossible();
}
else {
int l=0,r=n-k;
while (l<=r) {
int m=l+(r-l)/2;
ll sum=0;
for (int i=m; i<m+k; i++) {
sum+=skim(i+1);
}
if (sum<a) {
l=m+1;
}
else if (sum>2*a) {
r=m-1;
}
else {
vi inds(k);
iota(all(inds),m+1);
answer(inds);
}
}
impossible();
}
}
