#include <bits/stdc++.h>   using namespace std;   const long long N = 1e5 + 5;   long long n, k, z, a[N];   signed main() {     ios_base::sync_with_stdio(0);     cin.tie(0);     cout.tie(0);     long long t;     cin >> t;     while (t--) {       cin >> n >> k >> z;       long long sum = 0;       for (long long i = 1; i <= n; i++) cin >> a[i];       long long ans = 0;       for (long long j = 0; j <= z; j++) {         long long s = k - j;         if (s < j) break;         long long sum = 0;         long long mx = 0;         for (long long i = 1; i <= s - j + 1; i++)           sum += a[i], mx = max(a[i] + a[i + 1], mx);         ans = max(ans, sum + mx * j);       }       cout << ans <<   n ;     }     return 0;   }   