#include <bits/stdc++.h>
using namespace std;
long long int mod = 1e9 + 7;
long long int dp[200005][10];
long long int n, k, Z;
long long int arr[200005];
long long int solve(long long int id, long long int z) {
  long long int rem = k - ((id - 1) + 2 * z);
  if (rem == 0) return 0;
  if (rem < 0) return -2000000000;
  if (dp[id][z] != -1) return dp[id][z];
  long long int op1 = -2000000000;
  long long int op2 = -2000000000;
  if (id > 0 and z < Z) op2 = arr[id] + arr[id - 1] + solve(id, z + 1);
  op1 = arr[id] + solve(id + 1, z);
  return dp[id][z] = max(op1, op2);
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  long long int t;
  cin >> t;
  while (t--) {
    cin >> n >> k >> Z;
    for (long long int i = 0; i < n; i++) cin >> arr[i];
    for (long long int i = 0; i <= n; i++) {
      for (long long int j = 0; j <= 6; j++) dp[i][j] = -1;
    }
    cout << arr[0] + solve(1, 0) << "\n";
  }
  return 0;
}
