#include<bits/stdc++.h>
using namespace std;
typedef double db;
const db eps=1e-6;
int sign(db k)
{
	if(k>eps)return 1;
	if(k<-eps)return -1;
	return 0;
}
int cmp(db k1,db k2){return sign(k1-k2);}
struct p3
{
	db x,y,z;
	long long sub;
	p3 operator+(const p3 &k1)const{return {(p3){x+k1.x,y+k1.y,z+k1.z,sub|k1.sub}};}
	p3 operator-(const p3 &k1)const{return {(p3){x-k1.x,y-k1.y,z-k1.z,sub|k1.sub}};}
	p3 operator*(const db k1)const{return {(p3){x*k1,y*k1,z*k1,sub}};}
	p3 operator/(const db k1)const{return {(p3){x/k1,y/k1,z/k1,sub}};}
	db abs2()const{return x*x+y*y+z*z;}
	db abs()const{return hypot(hypot(x,y),z);}
	p3 unit()const{return *this/abs();}
	int operator<(const p3&k1)const
	{
		if(cmp(x,k1.x)!=0)return x<k1.x;
		if(cmp(y,k1.y)!=0)return y<k1.y;
		return cmp(z,k1.z)==-1;
	}
	int operator==(const p3 &k1)const
	{
		return cmp(x,k1.x==0) and cmp(y,k1.y)==0 and cmp(z,k1.z)==0;
	}
};
p3 cross(const p3 &k1,const p3 &k2)
{
	return (p3){k1.y*k2.z-k1.z*k2.y,k1.z*k2.x-k1.x*k2.z,k1.x*k2.y-k1.y*k2.x,0};
}
db dot(const p3 &k1,const p3 &k2)
{
	return k1.x*k2.x+k1.y*k2.y+k1.z*k2.z;
}
typedef vector<p3> vp;
typedef vector<vp> vvp;
mt19937 rng(58);
db rand_db(){return (rng()%1000000000)/1e9;}
db getV(const p3 &k1,const p3 &k2,const p3 &k3,const p3 &k4)
{
	return dot(cross(k2-k1,k3-k1),k4-k1);
}
namespace CH3
{
	vvp ret;set<pair<int,int>> e;
	int n;vp p,q;
	void wrap(int a,int b)
	{
		if(not e.contains({a,b}))
		{
			int c=-1;
			for(int i=0;i<n;i++)
				if(i!=a and i!=b)
					if(c==-1 or sign(getV(q[c],q[a],q[b],q[i]))>0)c=i;
			if(c!=-1)
			{
				ret.push_back({p[a],p[b],p[c]});
				e.emplace(a,b);e.emplace(b,c);e.emplace(c,a);
				wrap(c,b);wrap(a,c);
			}
		}
	}
	vvp convexhull3d(vp _p)
	{
		p=q=_p;n=p.size();
		ret.clear();e.clear();
		for(auto &i:q)i=i+(p3){rand_db()/1e4,rand_db()/1e4,rand_db()/1e4,0};
		for(int i=1;i<n;i++)if(q[i].x<q[0].x)swap(p[0],p[i]),swap(q[0],q[i]);
		for(int i=2;i<n;i++)if((q[i].x-q[0].x)*(q[1].y-q[0].y)>(q[i].y-q[0].y)*(q[1].x-q[0].x))swap(q[1],q[i]),swap(p[1],p[i]);
		wrap(0,1);
		return ret;
	}
}
vp merge(const vp &A,const vp &B,const p3 &x)//merge A+x and B
{
	vp C;
	for(auto &z:A)C.emplace_back(z+x);
	for(auto &z:B)C.emplace_back(z);
	if(C.size()<=2u)return C;
	auto tmp=CH3::convexhull3d(C);
	map<tuple<int,int,int>,long long> tmp2;
	for(const auto &vec:tmp)
		for(const auto &pt:vec)
			tmp2[{pt.x,pt.y,pt.z}]=pt.sub;
	vp ret;
	for(const auto &[pt,sub]:tmp2)
		ret.push_back((p3){get<0>(pt),get<1>(pt),get<2>(pt),sub});
	return ret;
}
int main()
{
	int T;
	cin>>T;
	while(T--)
	{
		int n,k;
		cin>>n>>k;
		vvp hull(n+5);
		hull[0].push_back((p3){0,0,0,0});
		for(int i=1;i<=n;i++)
		{
			p3 now;
			cin>>now.x>>now.y>>now.z;
			now.sub=(1ll<<(i-1));
			for(int j=min(i-1,k-1);j>=0;j--)
			{
				hull[j+1]=merge(hull[j],hull[j+1],now);
			}
		}
		db maxx=0;
		long long maxp=0;
		for(const auto &x:hull[k])
		{
			if(x.abs2()>maxx)maxx=x.abs2(),maxp=x.sub;
		}
		cout<<fixed<<setprecision(0)<<maxx<<endl;
		for(int i=0;i<n;i++)
			if((maxp>>i)&1)
				cout<<i+1<<' ';
		cout<<endl;
	}
	
	return 0;
}