#include <bits/stdc++.h>
#include"books.h"
using namespace std;
using ll = long long;
using vll = vector<ll>;
using vvl = vector<vll>;
using pll = pair<ll,ll>;
using vpl = vector<pll>;
using vvp = vector<vpl>;
#define f first
#define s second
#define pb push_back
#define all(v) v.begin(),v.end()
vll pas;
ll ski(ll a){
if(pas[a]==-1)return pas[a]=skim(a);
return pas[a];
}
void solve(int n, int k, long long a, int Q) {
ll s = 1, e = n, m;
pas = vll(n+1,-1);
while(s<e){
m = (s+e+1)/2;
ll t = ski(m);
if(t>=a)e=m-1;
else s=m;
}
vll v1(k), v2;
vector<int> id;
ll v3=-1;
for(ll i = 0; i < k; ++i){v1[i] = ski(i+1);}
for(ll i = max(1ll, s-k+1); i <= s; ++i){v2.pb(ski(i));id.pb(i);}
if(s<n)v3=ski(s+1);
ll p1=0, p2=0;
for(ll i:v1)p1+=i;
for(ll i:v2)p2+=i;
if(p1>2*a)impossible();
else if(k<=s){
if(p2>=a){
for(ll i = 0; i < k; ++i){
if(p2<=2*a)break;
id[i]=i+1;
p2 += v1[i]-v2[i];
}
answer(id);
}
else if(s<n){
iota(all(id),1);
id.back()=s+1;
if(p1-v1.back()+v3<=a*2)answer(id);
else impossible();
}
else impossible();
}
else{
iota(all(id),1);
if(p1>=a)answer(id);
else impossible();
}
}
