// Problem: A. B
// Contest: undefined - NOI2024省选训练赛 40
// URL: http://119.28.3.174/contest/955/problem/2452
// Memory Limit: 512 MB
// Time Limit: 2000 ms
// 
// Powered by CP Editor (https://cpeditor.org)

#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
#define eps 1e-8
#define inf 0x3f3f3f3f
#define INF 0x3f3f3f3f3f3f3f3f
inline int lowbit(int x){
	return (x&(-x));
}
int read(){
	int x=0,c=getchar(),f=1;
	while(c<'0' || c>'9'){
		if(c=='-')f=-1;
		c=getchar();
	}
	while(c>='0' && c<='9'){
		x=(x<<3)+(x<<1)+c-'0';
		c=getchar();
	}
	return f==1?x:-x;
}
void write(ll x){
	if(x>9)write(x/10);
	putchar(x%10+48);
}
int T,Tc;
int n;
ll f[85][85][6405];
ll x[85],y[85],z[85];
int main(){
	Tc=read();
	T=read();
	while(T--){
		n=read();
		for(int i=1;i<=n;i++){
			x[i]=read();
			y[i]=read();
			z[i]=read();
		}
		for(int i=0;i<=n+1;i++)for(int j=0;j<=n;j++)for(int k=0;k<=n*n;k++)f[i][j][k]=0xc0c0c0c0c0c0c0c0;
		f[n+1][0][0]=0;
		for(int i=n;i>=1;i--)for(int j=0;j<=n-i+1;j++)for(int k=0;k<=n*j;k++){
			if(j>0 && k>=i)f[i][j][k]=max(f[i][j][k],f[i+1][j-1][k-i]+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]+(k-j*i)*z[i]);
			// printf("f[%d][%d][%d]=%lld\n",i,j,k,f[i][j][k]);
		}
		ll ans=0;
		for(int i=0;i<=n;i++)for(int j=0;j<=n*n;j++)ans=max(ans,f[1][i][j]);
		write(ans);
		putchar(10);
	}
	return 0;
}
//quod erat demonstrandum