#include <bits/stdc++.h>
#include "books.h"
typedef long long ll;
using namespace std;
const int MAXN = 10e5 + 5;
int n, k;
ll a;
ll books[MAXN];
void ans(int i){
vector<int> res;
for (int j = i; j < i + k; j++) res.push_back(j);
answer(res);
}
void solve(int N, int K, long long A, int S) {
n = N, k = K, a = A;
for (int i = 1; i <= n; i++)
books[i] = skim(i);
ll sum = 0;
for (int i = 1; i <= k; i++) sum += books[i];
if (sum >= a and sum <= 2 * a) return ans(1);
for (int i = k + 1; i <= n; i++)
{
sum += books[i] - books[i - k];
if (sum >= a and sum <= 2 * a) return ans(i - k + 1);
}
if (sum >= a and sum <= 2 * a) return ans(n - k + 1);
impossible();
}
