#include <bits/stdc++.h>
#include "books.h"
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.
//
#define ll long long
void solve(int N, int K, long long A, int S) {
// TODO implement this function
int l = 1, r = N, m;
ll o;
while (l < r) {
m = (l + r) / 2;
o = skim(m);
if (o == A) {
l = m;
break;
}
if (o < A) {
l = m + 1;
} else {
r = m;
}
}
int pos_atleastA = l;
ll val_atleastA = skim(l);
int pos_lessthenA = l - 1;
vector<int> ind(K, 0);
vector<ll> firstk(K, 0);
ll sum = 0;
for (int i = 0; i < K; ++i) {
firstk[i] = skim(i + 1);
ind[i] = i + 1;
sum += firstk[i];
}
if (sum > 2 * A) {
impossible();
}
if (sum >= A) {
answer(ind);
}
if (val_atleastA >= A) {
ll tsum = sum - firstk[K - 1];
tsum += val_atleastA;
ind[K - 1] = pos_atleastA;
if (tsum <= 2 * A) {
answer(ind);
}
} else {
pos_lessthenA = l;
}
int i = K - 1;
while (sum < A && i >= 0) {
if (pos_lessthenA - K + i < 0) {
break;
}
sum = sum - firstk[i] + skim(pos_lessthenA - K + i);
ind[i] = pos_lessthenA - K + i;
--i;
}
if (sum >= A && sum <= 2 * A) {
answer(ind);
}
impossible();
}
