#include <bits/stdc++.h>
using namespace std;

int main() {
    int t;
    cin >> t;
    while (t--) {
        int n, k;
        cin >> n >> k;
        vector<long long> a(n);
        for (long long &x : a) cin >> x;

        long long ans = 0;
        for (int i = 0; i < k - 1; i++) {
            long long mx = i <= n - k ? max(a[i], a[n - i - 1]) : 0;
            a[i] = a[n - i - 1] = 0;
            ans += mx;
        }
        ans += accumulate(a.begin(), a.end(), 0LL);
        cout << ans << '\n';
    }
}