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

#define ll long long
#define ld long double
#define MOD 1000000007
#define pie 2 * (acos(0.0))
#define yes cout << "YES\n"
#define no cout << "NO\n"
#define pb push_back
#define nl '\n'
#define lcm(a, b) (a * b) / (__gcd<ll>(a, b))
#define print(v)          \
    for (auto e : v)      \
        cout << e << " "; \
    cout << endl;
#define printp(v)    \
    for (auto e : v) \
        cout << e.first << " " << e.second << endl;
#define srt(v) sort(v.begin(), v.end())
#define rsrt(v) sort(v.rbegin(), v.rend())
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rrep(i, n) for (int i = (n) - 1; i >= 0; i--)
#define FOR(i, a, b) for (int i = (a); i <= (b); i++)
#define RFOR(i, a, b) for (int i = (a); i >= (b); i--)
#define trav(a, x) for (auto &a : x)
#define F first
#define S second
#define setbit(x) __builtin_popcount(x)
#define sz(x) (int)(x).size()
#define vi vector<int>
#define pi pair<int, int>
#define even(n) if (n % 2 == 0)
#define odd(n) if (n % 2 == 1)
#define sp << " " <<

#define alliswell                \
    ios::sync_with_stdio(false); \
    cin.tie(nullptr);



void solve()
{
    int n, k;
    cin >> n >> k;
    vector<ll>a(n);
    vector<ll> pfs (n);
    rep(i, n)
    {
        cin >> a[i];
    }
    pfs[0] = a[0];
    for(int i = 1; i < n; i++)
    {
        pfs[i] = pfs[i-1] + a[i];
    }
    //print(pfs);
    ll ans = INT_MAX;
    for(int i = 0; i < n - k; i++)
    {
        ll v = pfs[i+k-1];
        ll vv = pfs[i+k-2] - (pfs[i+k-1] - (pfs[i+k]));
        ll add = min(v, vv);
        //cout << v << vv << nl;
        //cout << add << nl;
        if(i > 0)
        {
            ll kk = pfs[i+k-1] - pfs[i-1];
            ll le = pfs[i+k-2] - pfs[i-1];

            //cout << le << " " << kk;

            ll v = kk;
        ll vv = le -(kk - (a[i+k]));
        ll add = min(v, vv);
        }
        ans = min(ans, add);
    }
    cout << ans << nl;

}
int main()
{
    alliswell

    int t; cin  >> t;
    while(t--) solve();

    return 0;
}