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

using namespace std;

#define rep(i, s, e) for (int i = s; i <= e; ++i)
#define drep(i, s, e) for (int i = s; i >= e; --i)
#define file(a) freopen(#a".in", "r", stdin), freopen(#a".out", "w", stdout)
#define pv(a) cout << #a << " = " << a << endl
#define pa(a, l, r) cout << #a " : "; rep(_, l, r) cout << a[_] << ' '; cout << endl

using ll = long long;

const int N = 1e5 + 10;

ll a[N];
ll ask(int i) {
  if (~a[i]) return a[i];
  else return a[i] = skim(i);
}

void solve(int n, int k, ll A, int S) {
  rep(i, 1, n) a[i] = -1;
  int l = 0, r = n;
  while (l < r) {
    int mid = (l + r) >> 1;
    if (ask(mid + 1) < A) l = mid + 1;
    else r = mid;
  }
  if (l < k - 1) impossible();
  ll s = 0;
  if (l < n) {
    s = ask(l + 1);
    rep(i, 1, k - 1) s += ask(i);
    if (s <= 2 * A) {
      vector <int> ans;
      rep(i, 1, k - 1) ans.emplace_back(i);
      ans.emplace_back(l + 1);
      answer(ans);
    }
  }
  if (l == k - 1) impossible();
  rep(i, 0, k) {
    s = 0;
    rep(j, 1, i) s += ask(j);
    rep(j, 1, k - i) s += ask(l - j + 1);
    if (A <= s && s <= 2 * A) {
      vector <int> ans;
      rep(j, 1, i) ans.emplace_back(j);
      rep(j, 1, k - i) ans.emplace_back(l - j + 1);
      answer(ans);
    }
  }
  impossible();
}