#include <bits/stdc++.h>
using namespace std;
#include "books.h"
void solve(int N, int K, long long A, int S){
int l = 1, r = N;
int m = (l+r)/2;
vector<long long>F(N+1, 0);
while (l < r){
m = (l+r)/2;
long long x = skim(m);
F[m] = x;
if (x >= A){
r = m;
} else {
l = m+1;
}
}
if (l < K-1 || l == 1) impossible();
long long ans = 0;
for(int i = 1; i < K; i++){
F[i] = skim(i);
ans += F[i];
}
ans += F[l];
if (ans <= 2*A){
vector<int>v;
for(int i = 1; i < K; i++)v.push_back(i);
v.push_back(l);
answer(v);
}
if (l < K) impossible();
F[K-1] = skim(K-1);
ans -= F[l];
ans += F[K-1];
int t = 0;
while (ans < A){
ans -= F[t];
F[l-t-1] = skim(l-t-1);
ans += F[l-t-1];
t++;
if (t >= K) break;
}
if (ans >= A && ans <= 2*A){
vector<int>v;
for(int i = t; i < K; i++)v.push_back(i);
for(int i = l-t; i < l; i++)v.push_back(i);
answer(v);
} else {
impossible();
}
}
