#include<bits/stdc++.h>
//#pragma GCC optimize(3,"Ofast","inline")
//#define int long long
#define i128 __int128
#define ll long long
#define ull unsigned long long
#define uint unsigned int
#define ld double
#define PII pair<int,int>
#define INF 0x3f3f3f3f
#define INFLL 0x3f3f3f3f3f3f3f3f
#define chkmax(a,b) a=max(a,b)
#define chkmin(a,b) a=min(a,b)
#define rep(k,l,r) for(int k=l;k<=r;++k)
#define per(k,r,l) for(int k=r;k>=l;--k)
#define cl(f,x) memset(f,x,sizeof(f))
#define pcnt(x) __builtin_popcount(x)
#define lg(x) (31-__builtin_clz(x))
using namespace std;
void file_IO() {
//	system("fc .out .ans");
	freopen(".in","r",stdin);
	freopen(".out","w",stdout);
}
bool M1;
const int N=1e4+5;
int f[N][N],g[N][N],w[N];
vector<PII> vec[N];
void solve() {
	int n,m;
	scanf("%d%d",&n,&m);
	rep(i,0,n) {
		rep(j,0,n)
			f[i][j]=g[i][j]=0;
		vec[i].clear();
	}
	while(m--) {
		int l,r,val;
		scanf("%d%d%d",&l,&r,&val);
		vec[r].push_back(make_pair(l,val));
	}
	rep(i,0,n) {
		rep(j,0,n)
			f[i][j]=g[i][j]=-INF;
	}
	f[0][0]=g[0][0]=0;
	rep(k,0,n) {
		rep(i,0,n)
			w[i]=-INF;
		rep(i,k,n) {
			int j=i-k;
			g[i][j]=max(g[i-1][j],f[i-1][j]);
			w[i]=g[i][j];
			for(auto x:vec[i]) {
				rep(p,0,x.first)
					w[p]+=x.second;
			}
			int res=0;
			rep(j,0,i-1)
				chkmax(res,w[j]);
			f[i][j]=res;
		}
	}
	rep(i,1,n)
		printf("%d ",max(f[n][i],g[n][i]));
	puts("");
}
bool M2;
signed main() {
	//file_IO();
	int testcase=1;
	scanf("%d",&testcase);
	while(testcase--)
		solve();
	fprintf(stderr,"used time = %ldms\n",1000*clock()/CLOCKS_PER_SEC);
	fprintf(stderr,"used memory = %lldMB\n",(&M2-&M1)/1024/1024);
	return 0;
}