#include "books.h"
#include <bits/stdc++.h>
#ifndef EVAL
#include "grader.cpp"
#endif
using namespace std;
#define int long long
#define i32 int32_t
#define pb push_back
#define ff first
#define ss second
template<class T> bool umin(T& a, const T b) { if(a > b) { a = b; return 1; } return 0; }
template<class T> bool umax(T& a, const T b) { if(a < b) { a = b; return 1; } return 0; }
template<int sz> using tut = array<int, sz>;
const int M = 2e5+5;
const long long inf = 1e18;
const int mod = 1e9+7;
int a[M], pref[M];
bitset<M> used;
void get(int m){
if(used[m]) return;
a[m] = skim(m), used[m] = 1;
}
void solve(i32 n, i32 k, int A, i32 s) {
int l = 1, r = n;
while(l < r){
int m = (l + r)>>1; get(m);
if(k * a[m] < A) l = m;
else if(k * a[m] > 2 * A) r = m;
else { l = m, r = m; break; }
}
for(int i=max(1ll, l-k+1);i<=min((int)n, l+k-1);i++) get(i), pref[i] += pref[i-1];
for(int i=max(l, (int)k);i<=min((int)n, l+k-1);i++){
if(pref[i] - pref[i-k] >= A && pref[i] - pref[i-k] <= 2 * A){
vector<i32> res;
for(int l=i-k+1;l<=i;l++) res.pb(l);
answer(res); return;
}
}
int sum = 0;
for(int i=1;i<k;i++) get(i), sum += a[i];
for(int i=k;i<=n;i++){
if(!used[i]) continue;
if(sum + a[i] >= A && sum + a[i] <= 2*A){
vector<i32> res;
for(int l=1;l<k;l++) res.pb(l);
res.pb(i), answer(res); return;
}
} impossible();
return;
}
/*
4 3 20 5
5 10 17 25
*/
