#include <bits/stdc++.h>
using namespace ::std;
const long double PI = acos(-1);
const long long MOD = 1000000000 + 7;
long long gcd(long long a, long long b) { return b == 0 ? a : gcd(b, a % b); }
long long add(long long a, long long b, long long m = MOD) {
  if (a >= m) a %= m;
  if (b >= m) b %= m;
  if (a < 0) a += m;
  if (b < 0) b += m;
  long long res = a + b;
  if (res >= m or res <= -m) res %= m;
  if (res < 0) res += m;
  return res;
}
long long mul(long long a, long long b, long long m = MOD) {
  if (a >= m) a %= m;
  if (b >= m) b %= m;
  if (a < 0) a += m;
  if (b < 0) b += m;
  long long res = a * b;
  if (res >= m or res <= -m) res %= m;
  if (res < 0) res += m;
  return res;
}
long long pow_mod(long long a, long long b, long long m = MOD) {
  long long res = 1LL;
  a = a % m;
  while (b) {
    if (b & 1) res = mul(res, a, m);
    b >>= 1;
    a = mul(a, a, m);
  }
  return res;
}
long long fastexp(long long a, long long b) {
  long long res = 1LL;
  while (b) {
    if (b & 1) res = res * a;
    b >>= 1;
    a *= a;
  }
  return res;
}
int gcdExtendido(int a, int b, int *x, int *y) {
  if (a == 0) {
    *x = 0;
    *y = 1;
    return b;
  }
  int x1, y1;
  int gcd = gcdExtendido(b % a, a, &x1, &y1);
  *x = y1 - (b / a) * x1;
  *y = x1;
  return gcd;
}
int modInverso(int a, int m) {
  int x, y;
  int g = gcdExtendido(a, m, &x, &y);
  if (g != 1)
    return -1;
  else
    return (x % m + m) % m;
}
const int N = 100000 + 5;
const int inf = 1e9;
int n;
int k;
int z;
int a[N];
bool vis[N][6][2];
int memo[N][6][2];
int DP(int moves, int left, int last_left) {
  int pos = 1 + moves - 2 * left;
  if (moves == k) return a[pos];
  if (vis[moves][left][last_left]) return memo[moves][left][last_left];
  int ans = -inf;
  if (pos >= 1 and left + 1 <= z and !last_left) {
    ans = max(ans, a[pos] + DP(moves + 1, left + 1, 1));
  }
  if (pos + 1 <= n) {
    ans = max(ans, a[pos] + DP(moves + 1, left, 0));
  }
  vis[moves][left][last_left] = true;
  return memo[moves][left][last_left] = ans;
}
void clearAll() {
  for (int i = 0; i <= k; i++) {
    for (int j = 0; j <= z; j++) {
      vis[i][j][0] = vis[i][j][1] = false;
    }
  }
}
int main() {
  int t;
  scanf("%d", &(t));
  while (t--) {
    scanf("%d %d %d", &(n), &(k), &(z));
    for (int i = 1; i <= n; i++) scanf("%d", &(a[i]));
    printf("%d\n", DP(0, 0, 0));
    clearAll();
  }
  return 0;
}
