#include <bits/stdc++.h>
using namespace std;
#define MAXN 30010
#define INF 1e9
#define WL(t) while(t--)
#define FOR(i,s,e) for(int i=s; i<=e; i++)
int memo[MAXN][510], p[MAXN], prefix[MAXN];
int n, k, w;
class fastio {
public:
fastio() {
ios_base::sync_with_stdio(false);
cout.tie(nullptr);
cin.tie(nullptr);
}
} __fastio;
void prefixSum() {
prefix[0] = 0;
FOR(i,1,n) {
prefix[i] = prefix[i-1] + p[i];
}
}
void input() {
cin >> n >> k >> w;
p[0] = 0;
FOR(i,1,n) {
cin >> p[i];
}
}
int f(int i, int k) {
if(i > n-w+1) return 0;
if(k == 0) return 0;
if(memo[i][k] != -1) return memo[i][k];
return memo[i][k] = max(f(i+1,k), f(i+w, k-1) + prefix[i+w-1] - prefix[i-1]);
}
void solve() {
input();
prefixSum();
memset(memo, -1, sizeof(memo));
cout << f(1,k) << endl;
}
int main() {
__fastio;
int t; cin >> t;
WL(t) {
solve();
}
return 0;
}