#include <bits/stdc++.h>
#include "books.h"
using namespace std;

typedef long long ll;

ll a[100005];
int id[30];
void solve(int N, int K, ll A, int S)
{
	ll tmp = A / K;
	int pos = 0;
	for (int i = 17; ~i; i--)
	{
		if (skim(min(N, pos + (1 << i))) <= tmp) pos = min(N, pos + (1 << i));
		if (pos == N) break;
	}
	if (pos == N)
	{
		impossible();
		return;
	}
	
	int n = 0;
	if (pos)
	{
		a[pos] = skim(pos);
		id[n = 1] = pos;
	}
	
	ll sum = 0;
	for (int i = 1; i <= min(K, N - pos); i++)
	{
		ll x = skim(pos + i);
		if (x > 2 * A) break;
		a[pos + i] = x, id[++n] = pos + i;
		sum += x;
	}
	
	if (sum >= A)
	{
		for (int i = 1; i <= min(K, pos - 1); i++) a[i] = skim(i), id[++n] = i;
	}
	else
	{
		for (int i = 1; i <= min(K, pos - 1); i++) a[pos - i] = skim(pos - i), id[++n] = pos - i;
	}
	
	int nn = 1 << n;
	for (int st = 0; st < nn; st++)
	{
		int cnt = 0;
		ll res = 0;
		for (int i = 0; i < n; i++)
			if (st & (1 << i)) cnt++;
		if (cnt != K) continue;
		for (int i = 0; i < n; i++)
			if (st & (1 << i)) res += a[id[i + 1]];
		if (res >= A && res <= A * 2)
		{
			vector<int> v;
			for (int i = 0; i < n; i++)
				if (st & (1 << i)) v.push_back(id[i + 1]);
			answer(v);
			return;
		}
	}
	impossible();
}