#include <bits/stdc++.h>
#include "books.h"
using namespace std;
#define int long long
#define pb push_back
#define mp make_pair
#define fr first
#define sc second
//
// --- Sample implementation for the task books ---
//
// To compile this program with the sample grader, place:
// books.h books_sample.cpp sample_grader.cpp
// in a single folder and run:
// g++ books_sample.cpp sample_grader.cpp
// in this folder.
//
int n;
void solve(int32_t N, int32_t k, long long A, int32_t S) {
n = N;
// TODO implement this function
vector<int> b(n+1,0), pf(n+1,0);
for(int i = 1; i <= n; i++) {
b[i] = skim(i);
pf[i] = pf[i-1]+b[i];
}
for(int i = 1; i <= n; i++) {
// r-l+1 = k -> l = r-k+1
int r = i;
int l = r-k+1;
if(l < 1) continue;
int sum = 0;
for(int j = l; j <= r; j++) {
sum+= b[j];
if(sum > 2*A) {
break;
}
}
if(sum >= A && sum <= 2*A) {
vector<int32_t> ans;
for(int j = l; j <= r; j++) {
ans.pb(j);
}
answer(ans);
return;
}
}
for(int i = k; i <= n; i++) {
// (1,k-1) and i
int sum = 0;
for(int j = 1; j <= k-1; j++) {
sum+= b[j];
if(sum > 2*A) {
break;
}
}
if(sum+b[i] >= A && sum+b[i] <= 2*A) {
vector<int32_t> ans;
for(int j = 1; j <= k-1; j++) {
ans.pb(j);
}
ans.pb(i);
answer(ans);
return;
}
}
impossible();
}
