#include <bits/stdc++.h> #include "books.h" using namespace std; typedef long long ll; void solve(int n, int k, ll s, int c) { vector < int > ans; ll a[n + 1], cur = 0; for(int i = 1; i <= n; i++) a[i] = skim(i); for(int i = 1; i <= n; i++){ if(s <= a[i] && a[i] <= 2 * s){ answer({i}); return; } } for(int i = n; i >= 1; i--){ if(a[i] < s && k){ cur += a[i], k--, ans.push_back(i); if(cur >= s){ answer(ans); return; } } } impossible(); }