#include <bits/stdc++.h>
#include "books.h"
using namespace std;
#define rep(i,a,b) for (int i = (a); i <= (b); i++)
#define repa(i,a,b) for (int i = (a); i >= (b); i--)
#define lli long long
#define debug(a) cout << #a << " = " << a << endl
#define debugsl(a) cout << #a << " = " << a << ", "
#define MAX 100000
lli l,r,n,a,s,k,falt;
lli arr[MAX+2],activos[MAX+2];
vector<int> res;
lli binaria(lli lim, bool tipo) {
lli ult,ini,fin,mitad,p;
ini = 0;
fin = n;
while (ini <= fin) {
mitad = (ini+fin)/2;
if (arr[mitad] == -1) arr[mitad] = skim(mitad);
p = arr[mitad];
if (!tipo && p <= lim) {
ult = mitad;
ini = mitad+1;
}
else if (tipo && p < lim) {
ult = mitad;
ini = mitad+1;
}
else fin = mitad-1;
}
if (tipo) ult++;
return ult;
}
void solve(int N, int K, long long A, int S) {
a = A;
n = N;
k = K;
s = S;
rep(i,1,n) arr[i] = -1;
l = a/k;
l = binaria(l,true);
r = (2*a)/k;
r = binaria(r,false);
if (r < l) {impossible(); return;}
debugsl(l);
debug(r);
if ((r-l+1) >= k) {
res.resize(k,0);
rep(i,0,k-1) res[i] = l+i;
answer(res);
}
else {
falt = k - (r-l+1);
lli sum = 0;
l = max(1ll,l-falt);
r = min(n,r+falt);
rep(i,l,r) if (arr[i] == -1) skim(i);
rep(i,0,k-1) {
sum += arr[i+l];
activos[i+l] = 1;
}
lli nuevo = l+k;
while (sum < a && nuevo <= r) {
sum += arr[nuevo];
activos[nuevo++] = 1;
rep(i,l,nuevo-1) {
if (activos[i] == 0) continue;
if (sum-arr[i] <= (2*a)) {
sum -= arr[i];
activos[i] = 0;
break;
}
}
}
if (sum >= a && sum <= (2*a)) {
rep(i,l,r) if (activos[i] == 1) res.push_back(i);
answer(res);
}
else impossible();
}
}
