#include <bits/stdc++.h>
#include "books.h"
// #define int long long
// #define fi first
// #define se second
//
// #define sz(a) (int)((a).size())
// #define all(a) (a).begin(), (a).end()
//
// #define lsb(x) (x & (-x))
// #define vi vector<int>
// #define YES { cout << "YES" << endl; return; }
// #define NO { cout << "NO" << endl; return; }
// using ll = long long;
// using pii = std::pair<int, int>;
const int NMAX = 1e5;
using namespace std;
int64_t mins[NMAX + 5];
void solve(int N, int K, long long A, int S) {
int64_t mins[K];
for(int i = 0; i < K; i++)
mins[i] = skim(i + 1);
int64_t sum = 0;
for(int i = 0; i < K; i++)
sum += mins[i];
if(sum > 2 * A) {
impossible();
return;
}
if(sum >= A) {
vector<int> res;
for(int i = 0; i < K; i++)
res.push_back(i + 1);
answer(res);
return;
}
int lo = K, hi = N;
while(lo < hi){
int mid = (lo + hi) / 2;
int64_t x = skim(mid + 1);
if(x > A)
hi = mid;
else
lo = mid + 1;
}
if(lo < N){
int64_t big = skim(lo + 1);
sum = 0;
vector<int> res;
for(int i = 0; i < K - 1; i++) {
sum += mins[i];
res.push_back(i + 1);
}
sum += big;
res.push_back(lo + 1);
if(sum <= 2 * A){
answer(res);
return;
}
}
vector<pair<int, int64_t> > arr;
for(int i = 0; i < K; i++)
arr.push_back(make_pair(i, mins[i]));
for(int i = max(lo - K, K); i < lo; i++)
arr.push_back(make_pair(i, skim(i + 1)));
int n = arr.size();
sum = 0;
for(int i = n - K; i < n; i++)
sum += arr[i].second;
if(sum < A){
impossible();
return;
}
vector<int> res;
sum = 0;
for(int i = 0; i < K; i++){
sum += arr[i].second;
res.push_back(i);
}
for(int i = K - 1; i >= 0; i--){
int nxt = (i == K - 1 ? n : res[i+1]);
while(res[i] < nxt) {
if(sum >= A && sum <= 2 * A){
for(int j = 0; j < K; j++)
res[j] = arr[res[j]].first + 1;
answer(res);
return;
}
if(res[i] + 1 >= nxt)
break;
sum -= arr[res[i]].second;
++res[i];
sum += arr[res[i]].second;
}
}
impossible();
}
