#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include "books.h"
#define ll long long
#define ld long double
#define ull unsigned long long
#define ff first
#define ss second
#define pii pair<int,int>
#define pll pair<long long, long long>
#define vi vector<int>
#define vl vector<long long>
#define pb push_back
#define rep(i, b) for(int i = 0; i < (b); ++i)
#define rep2(i,a,b) for(int i = a; i <= (b); ++i)
#define rep3(i,a,b,c) for(int i = a; i <= (b); i+=c)
#define count_bits(x) __builtin_popcountll((x))
#define all(x) (x).begin(),(x).end()
#define siz(x) (int)(x).size()
#define forall(it,x) for(auto& it:(x))
using namespace __gnu_pbds;
using namespace std;
typedef tree<int, null_type, less<int>, rb_tree_tag,tree_order_statistics_node_update> ordered_set;
//mt19937 mt;void random_start(){mt.seed(chrono::time_point_cast<chrono::milliseconds>(chrono::high_resolution_clock::now()).time_since_epoch().count());}
//ll los(ll a, ll b) {return a + (mt() % (b-a+1));}
const int INF = 1e9+50;
const ll INF_L = 1e18+40;
const ll MOD = 1e9+7;
void solve(int n, int k, long long A, int s)
{
int l = 1;
int r = n;
int poz = -1;
while(l <= r)
{
int mid = (l+r)/2;
if(skim(mid) < A)
{
poz = mid;
l = mid+1;
}
else
{
r = mid-1;
}
}
if(poz == -1)
{
impossible();
return;
}
vl first_seg(k);
vl second_seg(k);
rep2(i,1,k) first_seg[i-1] = skim(i);
ll first_sum = 0;
forall(it,first_seg) first_sum += it;
if(first_sum > A*2)
{
impossible();
return;
}
if(first_sum >= A)
{
vi ans;
rep2(i,1,k) ans.pb(i);
answer(ans);
return;
}
if(poz != n)
{
if(first_sum + skim(poz+1) - first_seg[k-1] <= A*2)
{
vi ans;
rep2(i,1,k-1) ans.pb(i);
ans.pb(poz+1);
answer(ans);
return;
}
}
if(poz < k)
{
impossible();
}
rep2(i,1,k) second_seg[i-1] = skim(poz-i+1);
rep(i,k)
{
first_sum -= first_seg[k-i-1];
first_sum += second_seg[i];
if(first_sum >= A && first_sum <= A*2)
{
vi ans;
rep2(j,1,k-i-1) ans.pb(j);
rep2(j,poz-i,poz) ans.pb(j);
answer(ans);
return;
}
}
impossible();
}
