#include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 5;
void solve() {
  int n, k, y;
  cin >> n >> k >> y;
  int a[n];
  multiset<int> m;
  for (int i = 0; i < n; i++) {
    cin >> a[i];
  }
  int ans = 0;
  for (int i = 1; i <= k; i++) ans += a[i];
  int sum = ans;
  for (int i = 0; i <= k - 2; i++) m.insert(a[i] + a[i + 1]);
  int cnt = 0;
  for (int i = k - 2; i >= 0; i -= 2) {
    cnt++;
    if (cnt > y) break;
    sum -= a[i + 1];
    sum -= a[i + 2];
    int temp = sum;
    int dmy = *m.rbegin();
    temp += cnt * dmy;
    ans = max(ans, temp);
    m.erase(m.find(a[i] + a[i + 1]));
    if (i != 0) m.erase(m.find(a[i] + a[i - 1]));
  }
  ans += a[0];
  cout << ans << "\n";
}
int main() {
  int t = 1;
  cin >> t;
  while (t--) {
    solve();
  }
}
