#include <bits/stdc++.h>
#include "books.h"
using namespace std;
void solve(int N, int K, long long A, int S) {
vector<int> v;
#define int long long
int l = 1, r = N+1, m, front = 0;
int a[N+1];
memset(a, -1, sizeof(a));
for(int i = 1; i <= K; i++) {
a[i] = skim(i);
front += a[i];
}
if(front > 2*A) impossible();
else if(front >= A) {
for(int i = 1; i <= K; i++) v.push_back(i);
answer(v);
}
while(l < r) {
m = (l+r)/2;
if(a[m] == -1) a[m] = skim(m);
if(a[m] < A) l = m+1;
else r = m;
}
if(l != N+1) {
if(a[l] == -1) a[l] = skim(l);
front += a[l]-a[K];
if(front <= 2*A) {
for(int i = 1; i < K; i++) v.push_back(i);
v.push_back(l);
answer(v);
}
front += a[K]-a[l];
}
for(int i = l-1; i >= max(l-K, 1LL); i--) {
if(a[i] == -1) a[i] = skim(i);
}
for(int i = K; i >= 1; i--) {
front += a[l-K+i-1] - a[i];
if(front >= A) {
for(int j = 1; j < i; j++) v.push_back(j);
for(int j = i; j <= K; j++) v.push_back(l-K+j-1);
answer(v);
}
}
impossible();
#undef int
}
