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