/*
Things to notice:
1. do not calculate useless values
2. do not use similar names
 
Things to check:
1. submit the correct file
2. time (it is log^2 or log)
3. memory
4. prove your naive thoughts 
5. long long
6. corner case like n=0,1,inf or n=m
7. check if there is a mistake in the ds or other tools you use
8. fileio in some oi-contest

9. module on time 
10. the number of a same divisor in a math problem
11. multi-information and queries for dp and ds problems
*/
#include<bits/stdc++.h>
using namespace std;
#define int long long
#define fi first
#define se second
#define pii pair<long long,long long>
#define mp make_pair
#define pb push_back
const int mod=998244353;
const int inf=0x3f3f3f3f;
const int INF=1e18;
int n,k;
int a[300005],b[300005];
int calc()
{
	for(int i=1;i<=n;i++) b[i]=a[i];
	priority_queue <int> q;
	int res=0;
	for(int i=1;i<=n;i++)
	{
		if(a[i]<0) res-=a[i],a[i]=0;
		if(q.size()&&q.top()>a[i]) res+=q.top()-a[i],q.pop(),q.push(a[i]);
		q.push(a[i]);
	}
	for(int i=1;i<=n;i++) a[i]=b[i];
	return res;
}
void solve()
{
	cin>>n>>k;
	for(int i=1;i<=n;i++) cin>>a[i];
	if(k==1) cout<<calc()<<"\n";
	else if(k==n)
	{
		int ans=INF;
		for(int i=1;i<=n;i++) 
		{
			ans=min(ans,calc());
			int tmp=a[n];
			for(int j=n-1;j>=1;j--) a[j+1]=a[j];
			a[1]=tmp;
		}
		cout<<ans<<"\n";
	}
	else if(k%2==0) cout<<"0\n";
	else
	{
		sort(a+1,a+1+n);
		int ans=INF;
		for(int i=1;i<n;i++) ans=min(ans,a[i+1]-a[i]);
		cout<<ans<<"\n";
	}
}
signed main()
{
	ios::sync_with_stdio(0);
	cin.tie(0);
	int _=1;
	cin>>_;
	while(_--) solve();
	return 0;
}