#include <bits/stdc++.h>
#include "books.h"
using namespace std;
using ll = long long;
//
// --- 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.
//
// vector <int> NUMS;
// ll skim(int x) {
// return NUMS[x];
// }
void solve(int N, int K, ll A, int S) {
vector <int> ans(K+1);
ll sum = 0;
vector <ll> nums(N+1);
for (int i = 1; i <= K; i++) {
nums[i] = skim(i);
sum += nums[i];
ans[i] = i;
}
if (sum > 2*A) {
impossible();
return;
}
int lo = 1, hi = N+1;
int lst = 0;
while (lo < hi) {
int mid = lo + (hi - lo) / 2;
if (nums[mid] == 0)
nums[mid] = skim(mid);
if (nums[mid] > A)
hi = mid;
else
lo = mid+1;
}
if (lo < K) {
impossible();
return;
}
if (nums[lo] != 0)
nums[lo] = skim(lo);
if (nums[lo] + sum - nums[K] >= A && nums[lo] + sum - nums[K] <= 2 * A){
ans[K] = lo;
vector <int> ans2(K);
for (int i = 0; i < K; i++)
ans2[i] = ans[i+1];
answer(ans2);
return;
}
lst = lo-1;
for (int i = K, pt2 = K, pt = lst; i >= 1 && sum < A && pt > i; i--, pt--) {
sum -= nums[pt2];
if (nums[pt] == 0)
nums[pt] = skim(pt);
if (sum + nums[pt] <= 2 * A) {
sum += nums[pt];
ans[i] = pt;
pt2--;
} else {
sum += nums[pt2];
}
}
if (sum < A || sum > 2 * A) {
impossible();
return;
}
vector <int> ans2(K);
for (int i = 0; i < K; i++)
ans2[i] = ans[i+1];
answer(ans2);
}
// int main() {
// int n, k, a, s;
// cin >> n >> k >> a >> s;
// NUMS.resize(n+1);
// for (int i = 1; i <= n; i++)
// cin >> NUMS[i];
// solve(n, k, a, s);
// }
