##
#include<bits/stdc++.h>
using namespace std;
int t,n,m,k;
int a[50005],sum[50005],f[30][50005];
int main()
{
freopen("locomotive.in","r",stdin);
freopen("locomotive.out","w",stdout);
scanf("%d",&t);
while(t--)
{
scanf("%d%d%d",&n,&m,&k);
memset(sum,0,sizeof(sum));
memset(f,0,sizeof(f));
for(int i=1; i<=n; i++)
cin>>a[i];
for(int i=1; i<=m; i++)
sum[1]+=a[i];
for(int i=m+1; i<=n; i++)
sum[i-m+1]=sum[i-m]-a[i-m]+a[i];
for(int i=1; i<=k; i++)
for(int j=m; j<=n; j++)
f[i][j]=max(f[i][j-1],f[i-1][j-m]+sum[j-m+1]);
printf("%d\n",f[k][n]);
}
return 0;
}
##