#include<bits/stdc++.h>

#define ll long long
#define pi pair<ll,ll>
#define vi vector<ll>
#define cpy(x,y,s) memcpy(x,y,sizeof(x[0])*(s))
#define mset(x,v,s) memset(x,v,sizeof(x[0])*(s))
#define all(x) begin(x),end(x)
#define fi first
#define se second
#define mp make_pair
#define pb push_back
#define ary array
#define eb emplace_back
#define IL inline

using namespace std;

#define N 10005

ll read(){
    ll x=0,f=1;char ch=getchar();
    while(ch<'0' || ch>'9')f=(ch=='-'?-1:f),ch=getchar();
    while(ch>='0' && ch<='9')x=(x<<1)+(x<<3)+(ch^48),ch=getchar();
    return x*f;
}
void write(ll x){
    if(x<0)x=-x,putchar('-');
    if(x/10)write(x/10);
    putchar(x%10+'0');
}

vector<pi> c[N];

ll pre[N],nex[N],f[N],add[N],g[N],res[N],fa[N];

ll find(ll x){return (x==fa[x]?x:fa[x]=find(fa[x]));}
void del(ll x){
    fa[x]=pre[x];add[pre[x]]+=add[x];
    pre[nex[x]]=pre[x];nex[pre[x]]=nex[x];
}


void solve(){
    ll n=read()+1,m=read();
    for(ll i=1;i<=n;i++)c[i].clear();
    for(ll i=1;i<=m;i++){
        ll l=read()+1,r=read()+1,w=read();
        c[r].eb(l,w);
    }
    for(ll i=1;i<=n;i++){
        f[i]=f[i-1];
        for(auto [l,w]:c[i])f[i]+=w;
    }
    res[1]=f[n];
    for(ll k=2;k<=n-1;k++){
        for(ll i=k-1;i<=n;i++)fa[i]=i,add[i]=0,pre[i]=nex[i]=0,g[i]=f[i];
        ll tp=0;
        for(ll i=k;i<=n;i++){
            for(auto [l,w]:c[i]){
            
                if(l-1<k-1)continue;
                
                ll pos=find(l-1);add[pos]+=w;
                //cerr<<i<<' '<<l-1<<' '<<pos<<' '<<add[pos]<<' '<<w<<"**"<<endl;
                //cerr<<pos<<' '<<nex[pos]<<endl;
                if(nex[pos] && add[pos]+g[pos]>=g[nex[pos]]){
                    del(nex[pos]);
                }
            }
            ll pos=find(i-1);
            f[i]=g[pos]+add[pos];
            //cerr<<i<<' '<<pos<<' '<<g[4]<<' '<<k<<endl;
            
            pos=find(i-1);
            if(g[pos]+add[pos]<g[i]){
                nex[pos]=i;pre[i]=pos;
            }
            else fa[i]=pos;
        }
        res[k]=f[n];
    }
    for(ll i=n-1;i>=1;i--)write(res[i]),putchar(' ');
    putchar('\n');
}

int main(){
    #ifdef EAST_CLOUD
    freopen("a.in","r",stdin);
    //freopen("a.out","w",stdout);
    #endif

    ll T=read();while(T--)solve(); 
    return 0;
}