#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int n,l,m;constexpr int N=1e5+5;
ll f[N],g[N];int a[N];
ll s2[N],s1[N];
inline void solve(int l,int r){
	if(l>=r) return;
	int mid=l+r>>1;
	for(int i=mid,mn=1e9;i>=l;i--){
		s2[i]=f[i];
		if(i<mid)s1[i]=f[i]-mn;else s1[i]=LLONG_MIN;
		if(i<mid)s2[i]=max(s2[i],s2[i+1]),s1[i]=max(s1[i],s1[i+1]);
		mn=min(mn,a[i]);
	}
	for(int i=mid+1,mn=1e9;i<=r;i++){
		int p=max(l,i-::l);
		if(p>mid) break;
		g[i]=max(g[i],a[i]+max(s1[p],i==mid+1?LLONG_MIN:s2[p]-mn));
		mn=min(mn,a[i]);
	}
	solve(l,mid),solve(mid+1,r);
}
int sumn=0;
inline ll solve(){
	cin>>n>>l>>m;sumn+=n;
	for(int i=1;i<=n;i++) cin>>a[i];
	for(int i=1,mn=1e9;i<=n;i++) mn=min(mn,a[i]),g[i]=a[i]-mn;
	while(--m){
		memcpy(f,g,sizeof(*f)*(n+1));
		solve(1,n);
		// for(int i=1;i<=n;i++) cout<<f[i]<<' ';cout<<'\n';
		// for(int i=1;i<=n;i++) cout<<g[i]<<' ';cout<<'\n';
	}
	return *max_element(g+1,g+n+1);
}
int main(){
	std::ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
	int t;cin>>t;
	for(int i=1;i<=t;i++) cout<<"Case "<<i<<": "<<solve()<<'\n';
	assert(sumn<=5e5);
}