#include<bits/stdc++.h>
#include "books.h"
using namespace std;
#define all(fl) fl.begin(),fl.end()
#define pb push_back
#define fi first
#define se second
#define for1(i,j,k) for(int i=j;i<=k;i++)
#define for2(i,j,k) for(int i=j;i>=k;i--)
#define for3(i,j,k,l) for(int i=j;i<=k;i+=l)
#define lb lower_bound
#define ub upper_bound
#define sz(a) (int)a.size()
#define pii pair<int,int>
#define pli pair<long long,int>
#define gcd __gcd
#define lcm(x,y) x*y/__gcd(x,y)
const int maxn=1e5+9;
long long a[maxn];
void solve(int n,int k,long long A,int s){
set<long long>b;
set<long long>::iterator it;
map<long long,int>i1;
for1(i,1,n){
a[i]=skim(i);
b.insert(a[i]);
i1[a[i]]=i;
}
vector<int>id;
long long sum=0;
while (!b.empty()){
if (sz(id)==k)break;
it=b.end();
it--;
b.erase(it);
sum+=(*it);
int les=k-sz(id)-1;
long long vl=0;
for (auto v:b){
if (les==0)break;
vl+=v;
}
if (vl+s<=2*A){
id.pb(i1[(*it)]);
}
else {
sum-=(*it);
}
}
if (sz(id)==k){
answer(id);
return;
}
impossible();
}
/*signed main(){
ios_base::sync_with_stdio(0);
cin.tie(0);
//freopen(".INP","r",stdin);
//freopen(".OUT","w",stdout);
}*/
