#include <bits/stdc++.h>
using namespace std;
#define int              long long int
#define double           long double
#define print(a)         for(auto x : a) cout << x << " "; cout << endl


const int M = 1000000007;
const int N = 3e5+9;
const int INF = 2e9+1;
const int LINF = 2000000000000000001;

inline int power(int a, int b, int mod=M) {
    int x = 1;
    a %= mod;
    while (b) {
        if (b & 1) x = (x * a) % mod; 
        a = (a * a) % mod;
        b >>= 1;
    }
    return x;
}


//_ ***************************** START Below *******************************




vector<int> a;

int consistency1(int n, int x, int y){
	
	int cost = INF;
	vector<int> prefix(n+1);
	
	for(int i=0; i<n; i++){
		if(i-y>=0)	prefix[i] = prefix[i-y] + a[i];
		else prefix[i] = a[i];
	}
	
	for(int i = 0; i < n; i++) {
	
	    if(i - x*y + y < 0) continue;
	
	    int sum = prefix[i];
	
	    if(i-x*y >= 0)
	        sum -= prefix[i-x*y];
	
	    cost = min(cost, sum);
	}
	
	return cost;
}


int consistency2(int n, int x, int y){
	
	int cost = INF;
	
	for(int i=0; i<y; i++){
		
		int s = i, e = i;
		int sum = 0;
		
		while(e<n){
			sum += a[e];
			if((e-s)/y + 1 < x){
				e+=y;
			}
			else{
				cost = min(cost, sum);
				sum -= a[s];
				s+=y;
				e+=y;
			}
		}
		
	}
	
	return cost;
}















int practice(int n, int x, int y){


    return 0;
}





void solve() {
    
    int n, x, y;
    cin>> n >> x >> y;
    
    a.resize(n);
    for(int i=0; i<n; i++) cin >> a[i];
    
    cout << consistency1(n, x, y) << " " << consistency2(n, x, y) << endl;


}





int32_t main() {
    ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);

    int t = 1;
    cin >> t;
    while (t--) {
        solve();
    }

    return 0;
}