//Author: gsczl71
//Copyright (c) 2023 gsczl71 All rights reserved.

#include<bits/stdc++.h>
#define ll long long
#define i128 __int128
#define ull unsigned long long
#define pii pair<int,int>
#define pll pair<long long, long long>
#define fir first
#define se second
#define endl '\n'
#define debug puts("AK IOI")
#define re register
#define pb push_back
using namespace std;
#define int long long
const int mod = 1e9+7;
//const int mod = 998244353;
const int inf = 0x3f3f3f3f,N = 2e5+5,M = 2e5+5;
const ll linf = 0x3f3f3f3f3f3f3f3f;
int n,k,x;	
int a[N];
void solve(){
	cin >> n>>k>>x;
	for(int i = 1;i <= n;i++) cin >> a[i];
	sort(a+1,a+1+n);
	int sum=0;
	for(int i=1;i<=n;i++)sum+=a[i];
	int cnt=-1e9;
	int hz=0,qz=0;
	for(int i = n;i >= n-x+1;i--){
		qz+=a[i];
	}
	for(int i = n;i>=1;i--){
//		cout<<sum-hz-2*qz<<endl;
		cnt=max(cnt,sum-hz-2*qz);
		if(k)hz+=a[i],k--;
		else break;
		qz-=a[i];
		if(i-x>0&&a[i-x]>0)qz+=a[i-x];
	}
	cnt=max(cnt,sum-hz-2*qz);
	
	cout<<cnt<<endl;
}
signed main(){
	ios::sync_with_stdio(false), cin.tie(nullptr), cout.tie(nullptr);
	int T=1;
	cin >> T;
	while(T--) solve();
	return 0;
}

本人随便搞了一下，发现好像都是Alice都是最大的几个，然后bob是除了alice选的最大的几个。

然后我就枚举Alice取了最大的k个数。

但蒟蒻不知道咋证