// Om Namah Shivaya
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
template<typename T> using Tree = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
typedef long long int ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define fastio ios_base::sync_with_stdio(false); cin.tie(NULL)
#define pb push_back
#define endl '\n'
#define sz(a) a.size()
#define setbits(x) __builtin_popcountll(x)
#define ff first
#define ss second
#define conts continue
#define ceil2(x, y) ((x + y - 1) / (y))
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define yes cout << "Yes" << endl
#define no cout << "No" << endl
#define rep(i, n) for(int i = 0; i < n; ++i)
#define rep1(i, n) for(int i = 1; i <= n; ++i)
#define rev(i, s, e) for(int i = s; i >= e; --i)
#define trav(i, a) for(auto &i : a)
template<typename T>
void amin(T &a, T b) {
a = min(a, b);
}
template<typename T>
void amax(T &a, T b) {
a = max(a, b);
}
#ifdef LOCAL
#include "debug.h"
#else
#define debug(x) 42
#endif
/*
*/
const int MOD = 1e9 + 7;
const int N = 1e5 + 5;
const int inf1 = int(1e9) + 5;
const ll inf2 = ll(1e18) + 5;
#include "books.h"
void solve(int n, int k, long long A, int S) {
vector<ll> a(n);
rep(i,n) a[i] = skim(i+1);
rep(i,n){
if(i + k - 1 >= n) break;
vector<int> guys;
int ptr = i;
ll sum = 0;
rep(j,k){
guys.pb(ptr+1);
sum += a[ptr];
ptr++;
}
if(sum >= A and sum <= 2*A){
answer(guys);
}
}
impossible();
// set<int> st;
// rep(mask,1<<n){
// if(setbits(mask) != k) conts;
// int sum = 0;
// rep(i,n){
// if(mask & (1 << i)){
// sum += a[i];
// }
// }
// st.insert(sum);
// }
// debug(st);
// impossible();
}
