#include <bits/stdc++.h>
using namespace std;
void solve() {
  long long n, k, z;
  cin >> n >> k >> z;
  long long a[n];
  for (auto &x : a) cin >> x;
  long long ans = 0;
  for (long long i = 0; i <= k; i++) ans += a[i];
  long long ind = k, tmp = ans, tmp2 = ans - a[k];
  ;
  for (long long i = 0; i < z && ind >= 2; i++) {
    tmp -= a[ind] + a[ind - 1];
    ind -= 2;
    long long ma = 0;
    for (long long j = 0; j < ind; j++) {
      ma = max(ma, a[j] + a[j + 1]);
    }
    ans = max(ans, tmp + ma * (i + 1));
  }
  ind = k - 1;
  for (long long i = 0; i < z && ind >= 1; i++) {
    if (i) tmp2 -= a[ind] + a[ind - 1], ind -= 2;
    long long ma = 0;
    for (long long j = 0; j < ind; j++) {
      ma = max(ma, a[j] + a[j + 1]);
    }
    ans = max(ans, tmp2 + ma * i + (ind >= 1 ? a[ind - 1] : 0));
  }
  cout << ans << "\n";
}
signed main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  long long t;
  cin >> t;
  while (t--) solve();
}
