#include <bits/stdc++.h>
using namespace std;
int n, k, z;
int a[100010];
int sum[100010];
int mx[100010];
int f[100010];
int main() {
  int t;
  cin >> t;
  while (t--) {
    memset(a, 0, sizeof a);
    memset(f, 0, sizeof f);
    memset(mx, 0, sizeof mx);
    memset(sum, 0, sizeof sum);
    cin >> n >> k >> z;
    for (int i = 1; i <= n; i++) cin >> a[i], f[i] = f[i - 1] + a[i];
    for (int i = 1; i < n; i++) {
      sum[i] = a[i] + a[i + 1];
      if (sum[i] > sum[mx[i - 1]])
        mx[i] = i;
      else
        mx[i] = mx[i - 1];
    }
    k++;
    int ans = 0;
    for (int i = 0; i <= z; i++) {
      int nk = k - 2 * i;
      int tp = min(nk, n);
      ans = max(ans, f[tp] + sum[mx[tp]] * i);
    }
    cout << ans << endl;
  }
  return 0;
}
