#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int t, n, k, z;
void fn() {
  cin >> n >> k >> z;
  int a[n + 5];
  ll dp[n][z + 1][2];
  for (int i = 1; i <= n; i++) cin >> a[i];
  for (int i = 0; i <= k; i++) {
    for (int j = 0; j <= z; j++) {
      dp[i][j][0] = -1e18;
      dp[i][j][1] = -1e18;
    }
  }
  dp[0][0][0] = a[1];
  for (int i = 0; i < k; i++) {
    for (int le = 0; le <= z && le <= i; le++) {
      for (int c = 0; c < 2; c++) {
        if (dp[i][le][c] < 0) continue;
        int pos = 1 + ((i - le) - le);
        if (pos < 1 || pos > n) continue;
        if (pos < n) {
          dp[i + 1][le][0] = max(dp[i + 1][le][0], dp[i][le][c] + a[pos + 1]);
        }
        if (pos > 1 && le < z && c == 0) {
          dp[i + 1][le + 1][1] =
              max(dp[i + 1][le + 1][1], dp[i][le][0] + a[pos - 1]);
        }
      }
    }
  }
  ll mx = -1e18;
  for (int i = 0; i <= z; i++) {
    mx = max(mx, dp[k][i][0]);
    mx = max(mx, dp[k][i][1]);
  }
  cout << mx << endl;
}
int main() {
  cin >> t;
  while (t--) fn();
  return 0;
}
