#include "books.h"
#include <bits/stdc++.h>
using namespace std;
#define FOR(i,a,b) for (int i = (a); i < (b); ++i)
#define pb push_back
#define all(a) a.begin(), a.end()
#define endl "\n"
// 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(int N, int K, long long A, int S) {
int pos = 0;
for (int i = 16; i >= 0; i--){
if ((pos|(1 << i)) > N) continue;
int t = pos|(1 << i);
if (skim(t) <= A) pos |= (1 << i);
}
if (pos == 0){
impossible();
return;
}
long long u = 0ll;
if (pos < N) u = skim(pos+1);
else u = 2e18;
vector<pair<long long, int>> a;
if (pos >= K-1){
FOR(i,1,K+1){
a.pb({skim(i), i});
}
long long sum = 0ll;
FOR(i,0,K-1) sum += a[i].first;
if (sum+u <= 2ll*A){
vector<int> ans = {};
FOR(i,1,K) ans.pb(i);
ans.pb(pos+1);
answer(ans);
return;
}
}
if (pos <= 2*K){
FOR(i,K+1,pos+1) a.pb({skim(i), i});
}else{
FOR(i,pos-K+1,pos+1) a.pb({skim(i), i});
}
int g = a.size();
int i = 0;
while (i+K-1 < g){
long long curr = 0ll;
FOR(j,i,i+K) curr += a[j].first;
if (curr >= A && curr <= 2ll*A){
vector<int> ans = {};
FOR(h,i,i+K) ans.pb(a[h].second);
answer(ans);
return;
}
i++;
}
impossible();
}
