#include <bits/stdc++.h>
using namespace std;
#define int              long long int
#define double           long double
#define print(a)         for(auto x : a) cout << x << " "; cout << endl


const int M = 1000000007;
const int N = 3e5+9;
const int INF = 2e9+1;
const int LINF = 2000000000000000001;

inline int power(int a, int b, int mod=M) {
    int x = 1;
    a %= mod;
    while (b) {
        if (b & 1) x = (x * a) % mod; 
        a = (a * a) % mod;
        b >>= 1;
    }
    return x;
}


//_ ***************************** START Below *******************************




vector<int> a;

int consistency(int n, int k){

	vector<vector<int>> dp(n, vector<int>(k+1, -INF));

	int maxi = -INF;
	for(int i=0; i<n; i++) maxi = max(maxi, a[i]);
	
	//* Exactly 2
	for(int i=0; i<n; i++) dp[i][1] = maxi;
	
	for(int j=2; j<=k; j++){
		for(int i=0; i<n; i++){
			if(i-1>=0) dp[i][j] = dp[i-1][j];
			
			if(i-2>=0) dp[i][j] = max( dp[i][j] , dp[i-2][j-1] + a[i] );
		}
	}
	
	maxi = -INF;
	for(int i=0; i<n; i++){
		maxi = max(maxi, dp[i][k]);
	}
	return maxi;

}















int practice(int n){


    return 0;
}





void solve() {
    
    int n, k;
    cin>> n >> k;
    
    a.resize(n);
    for(int i=0; i<n; i++) cin >> a[i];
    
    cout << consistency(n, k) << endl;


}





int32_t main() {
    ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);

    int t = 1;
    cin >> t;
    while (t--) {
        solve();
    }

    return 0;
}