#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
const long double pi = acos((ld)-1.0);
const double eps = (double)1e-9;
const int inf = (int)1e9 + 7;
const int fastio = []() {
  ios::sync_with_stdio(false);
  cin.tie(nullptr);
  cout.tie(nullptr);
  return 0;
}();
int main() {
  int t;
  cin >> t;
  while (t--) {
    int n, k, z;
    cin >> n >> k >> z;
    int a[n];
    for (int i = 0; i < n; i++) {
      cin >> a[i];
    }
    int ans = 0, mx = 0, sum = 0;
    for (int start = 0; start <= k; start++) {
      if (start < n - 1) {
        mx = max(mx, a[start] + a[start + 1]);
      }
      sum += a[start];
      if (start % 2 == k % 2) {
        int toLeft = (k - start) / 2;
        if (toLeft <= z) {
          ans = max(ans, sum + mx * toLeft);
        }
      }
    }
    cout << ans << endl;
  }
  return 0;
}
