#include<bits/stdc++.h>
using namespace std;
#define int long long
void solve()
{
	int n,k; cin>>n>>k;
	vector<int>v(n);
	for(int i=0;i<n;i++) cin>>v[i];
	
    int ans = 0;
    
    
    for(int i=0;i<k;i++)
    {
    	ans+=v[i];
    }
    int curr = ans;
    
   
    int idx = 0;
    // cout<<curr<<' ';
    for(int i=1;i<=n-k;i++)
    {
    	curr+=v[i+k-1];
    	
    	curr-=v[i-1];
    	if(curr<=ans)
    	{
    		ans = curr;
    		idx = i;
    	}
    	//cout<<curr<<' ';
    	
    	

    }
    
    int mx = INT_MIN;
    for(int i=idx;i<idx+k;i++)
    {
    	mx = max(v[i],mx);
    }
   
    int mn = mx;
    for(int i=0;i<idx;i++)
    {
    	mn = min(mn,v[i]);
    }
     
    for(int i = idx+k;i<n;i++)
    {
    	mn = min(mn,v[i]);
    }
   
    curr = ans;
    cout<<min(ans - mx + mn,curr)<<endl;

}
int32_t main()
{
    int t; 
    cin>>t;
    // t=1;
    while(t--)
    {
    	solve();
    }
	return 0;
}