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

#define nl '\n'
#define ll long long
#define int long long
#define pii pair<int, int> 



void solve(){
    int n, k; cin >> n >> k;
    vector<int> a(n);
    for(int i=0;i<n;++i) {
        cin >> a[i];
    }
    if(k==n){
        cout << accumulate(a.begin(), a.end(), 0ll) << nl;
        return;
    }
    multiset<int> st, all(a.begin(), a.end());
    int s = 0, ans = 2e18;
    for(int i = 0, j = 0;i<n;++i) {
        st.insert(a[i]);
        all.erase(all.find(a[i]));
        s+=a[i];
        if(i<k-1) continue;
        assert(st.size() == k);
        int tmp = s;
        int boro = *st.rbegin();
        int suto = *all.begin();
        if(boro > suto) {
            tmp -= boro;
            tmp += suto;
        }
        ans = min(ans, tmp);
        all.insert(a[j]);
        st.erase(st.find(a[j]));
        s -= a[j];
        j++;
    }
    cout << ans << nl;
}

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

    int t = 1, tc = 0;
    cin >> t ;
    while(t--){
        // cout << "Case " << ++tc  << ": ";
        solve();
    }
    return 0;
}