Cyclists.cpp

/* 
AUTHOR: Antarikshya Mitra
TIME: 
PROBLEM NO:- Cyclists Div 2 B
*/


#include<bits/stdc++.h>
using namespace std;
#define int long long 
#define endl '\n'
const int MOD = 1e9 + 7; 

void solve(vector<int> &arr,int k,int p,int m)
{
	int n = arr.size();
	vector<int> partof(k);
	for(int i=0;i<k;i++)
		partof[i] = arr[i];
	queue<int> q;
	int track = p-1;
	int total_energy = 0;
	int ans = 0;
	int var = arr[p-1];
	if(k<n){
		for(int i=k;i<n;i++){
			q.push(arr[i]);
		}
	}
	while(true){
			if(track < k){
	    	if(total_energy + var > m) break;
	    	if(!q.empty()){
	    	    partof[track] = q.front();
	    	    q.pop();
	    	    q.push(var);  
	    	}
	    	ans++;
	    	track = n - 1;
	    	total_energy += var;
		}
		else{
			int mini = min_element(partof.begin(),partof.end()) - partof.begin();
            if(total_energy+partof[mini]>=m) break;
			total_energy+=partof[mini];
			track--;
			if(!q.empty()){
				int old = partof[mini];
				partof[mini] = q.front();
				q.pop();
				q.push(old);
			}
		}
	}
	cout<<ans<<endl;
	return;
}

int32_t main()
{
	ios::sync_with_stdio(false);
    cin.tie(nullptr);
    cout.tie(nullptr);
	int t=1;
	cin>>t;
	while(t--)
	{
		int n,k,p,m;
		cin>>n>>k>>p>>m;
		vector<int> arr(n);
		for (auto &a:arr) 
			cin>>a;
		solve(arr,k,p,m);
	}	
	return 0;
}