#include <bits/stdc++.h>
#include "books.h"
#define all(v) v.begin(), v.end()
#define sz(x) (int)x.size()
#define pb push_back
#define pii pair<int, int>
#define chmin(x, v) x = min(x, v)
#define chmax(x, v) x = max(x, v)
#define print(x) cout << #x << " est " << x << endl;
#define x first
#define y second
#define int long long
using namespace std;
map<int, int> tmp;
int getVal(int i){
if (tmp.count(i) == 0)
tmp[i] = skim(i);
return tmp[i];
}
void solve(signed nLivres, signed aPrendre, long long borneInf, signed S) {
int deb = 1, fin = nLivres - aPrendre + 1;
while (fin > deb){
int mid = (fin + deb)/2;
int sum = 0;
for (int i = 0; i < aPrendre; ++i)
sum += getVal(i + mid);
if (sum >= borneInf && sum <= 2 * borneInf){
vector<signed> ans;
for (int i = 0; i < aPrendre; ++i)
ans.pb(i + mid);
answer(ans);
}
if (sum < borneInf)
deb = mid + 1;
else
fin = mid;
}
impossible();
}
