#include<bits/stdc++.h>
#define N 81
#define int long long
#define inf 1000000000000000000ll
using namespace std;
int read()
{
	int x=0,f=1;char ch=getchar();
	while(ch<'0'||ch>'9'){if(ch=='-')f=-1;ch=getchar();}
	while(ch>='0'&&ch<='9'){x=x*10+ch-'0';ch=getchar();}
	return x*f;
}
int f[N][N][N*N/2],n,x[N],y[N],z[N],m,t,num;
signed main()
{
	num=read();t=read();
	while(t--)
	{
		n=read();m=(n+1)*n/2;
		for(int i=n;i>=1;i--)
		{
			x[i]=read();
			y[i]=read();
			z[i]=read();
		}
		for(int i=0;i<=n;i++)
		{
			for(int j=0;j<=n;j++)
			{
				for(int k=0;k<=m;k++)
				f[i][j][k]=-inf;
			}
		}
		f[0][0][0]=0;
		for(int i=1;i<=n;i++)
		{
			for(int j=0;j<i;j++)
			{
				for(int k=0,con=i*(i-1)/2;k<=con;k++)
				{
					f[i][j+1][k+i]=max(f[i][j+1][k+i],f[i-1][j][k]+x[i]);
					f[i][j][k]=max(f[i][j][k],f[i-1][j][k]+j*y[i]);
					f[i][j][k]=max(f[i][j][k],f[i-1][j][k]+(i*j-k)*z[i]); 
				}
			}
		}
		int ans=0;
		for(int i=0;i<=n;i++)
		{
			for(int k=0;k<=m;k++)
			ans=max(ans,f[n][i][k]);
		}
		cout<<ans<<"\n"; 
	}
	return 0;
}