#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++) {
ans[i] = i;
nums[i] = skim(i);
sum += nums[i];
S--;
}
for (int i = K; i >= 1 && sum < A && S; i--, S--) {
int lo = K+1, hi = N-(K-i)-1;
sum -= nums[i];
if (nums[N - (K-i)] == 0)
nums[N - (K-i)] = skim(N - (K-i));
if (nums[N - (K-i)] + sum < 2*A) {
sum += nums[N - (K-i)];
ans[i] = N - (K-i);
continue;
}
while (lo < hi) {
int mid = lo + (hi - lo) / 2;
ll x = 0;
if (nums[mid] != 0)
x = nums[mid];
else {
nums[mid] = skim(mid);
x = nums[mid];
}
if (sum + x >= A) {
if (sum + x <= 2*A) {
lo = mid;
break;
}
hi = mid;
} else
lo = mid + 1;
}
if (nums[lo] == 0) {
nums[lo] = skim(lo);
}
sum += nums[lo];
ans[i] = lo;
}
if (sum > 2*A || sum < A) {
impossible();
} else {
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);
// }
