/*

*/
#include <bits/stdc++.h>
#include "books.h"
using namespace std;
typedef long long ll;
const int N = 1e5 + 10;
ll a[N]; int it[N];
inline ll query(int i) {
	if (a[i]) return a[i];
	return a[i] = skim(i);
}
inline int lower(int l, int r, ll lim) {
	int res = r, mid;
	while (l <= r) {
		mid = (l + r) >> 1;
		if (query(mid) >= lim) r = mid - 1, res = mid;
		else l = mid + 1;
	}
	return res;
}
inline void check(int it[], ll lim, int k) {
	ll s = 0;
	for (int i = 1; i <= k; ++i) s += query(it[i]);
	if (s >= lim && s <= (lim << 1))
		answer(vector<int>(it + 1, it + k + 1));
}
void solve(int n, int k, ll lim, int S) {
	ll s = 0;
	for (int i = 1; i < k; ++i) it[i] = i, s += query(i);
	if (s > (lim << 1)) impossible();
	n = lower(1, n, lim); it[k] = n;
	check(it, lim, k);
	int l = max(n - k, 0), m;
	for (int i = 1; i <= k; ++i) it[i] = i;
	for (int i = 1; i <= k; ++i) it[i + k] = i + l;
	sort(it + 1, it + 1 + k + k);
	m = unique(it + 1, it + 1 + k + k) - it;
	for (int i = 0; i < m - k; ++i) check(it + i, lim, k);
	impossible();
}