#include <bits/stdc++.h>
#include "books.h"

using namespace std;

typedef long long ll;

constexpr int N = 1e5 + 10;

ll a[N];

inline ll query(int x) {
    if (a[x]) return a[x];
    return a[x] = skim(x);
}

int find(int l, int r, ll A) {
    int mid, res = r;
    while (l <= r) {
        mid = (l + r) >> 1;
        if (query(mid) <= A) l = mid + 1;
        else res = mid, r = mid - 1;
    }
    return res;
}

void solve(int n, int K, ll A, int S) {
    cerr << A << '\n';
    vector<int> ans;
    for (int i = 1; i < K; i++) query(i);
    int k = n; ll s = 0;
    for (int i = 1; i < K; i++) s += a[i];
    if (query(n) > A) {
        k = find(1, n, A);
        if (s + query(k) <= 2 * A) {
            for (int i = 1; i <= K - 1; i++) ans.emplace_back(i);
            ans.emplace_back(k); answer(ans);
        } else k--;
    }
    if (k < K) impossible();
    s += query(K);
    if (s > 2 * A) impossible();
    else if (s >= A) {
        for (int i = 1; i <= K; i++) ans.emplace_back(i);
        answer(ans);
    }
    int front = K;
    for (int i = 1, j = k; i <= K && j > K; i++, j--) {
        s += query(j) - query(i);
        if (A <= s && s <= 2 * A) {
            for (int o = i + 1; o <= K; o++) ans.emplace_back(o);
            for (int o = j; o <= k; o++) ans.emplace_back(o);
            answer(ans);
        }
    }
    impossible();
}