#include<cstdio>

#include<map>

//#include<bits/stdc++.h>

#include<vector>

#include<stack>

#include<iostream>

#include<algorithm>

#include<cstring>

#include<cmath>

#include<queue>

#include<cstdlib>

#include<climits>

#define PI acos(-1.0)

#define INF 0x3fffffff

using namespace std;

typedef long long ll;

typedef __int64 int64;

const ll mood=1e9+;

const int64 Mod=;

const double eps=1e-;

const int N=1e3+;

const int MAXN=;

typedef int rl;

inline void r(rl&num){

    num=;rl f=;char ch=getchar();

    while(ch<''||ch>''){if(ch=='-')f=-;ch=getchar();}

    while(ch>=''&&ch<='')num=num*+ch-'',ch=getchar();

    num*=f;

}

int dp[N];//dp[i] 滚动数组

struct xxxx{

    int st,en,val;

}data[N];

bool cmp(struct xxxx a,struct xxxx b)

{

    return a.st<b.st;

}

int main()

{

    int ci;

    r(ci);

    int n,m;

    while(ci--)

    {

        r(m);r(n); //m假期时间 n工作数目

        memset(dp,,sizeof(dp));

        for(int i=;i<n;i++)

        {

            r(data[i].st);r(data[i].en);r(data[i].val);

        }

        for(int i=;i<=m;i++)

        {

            for(int j=;j<n;j++)

            {

                if(data[j].en<=i)dp[i]=max(dp[i],dp[data[j].st-]+data[j].val);

            }

        }

        printf("%d\n",dp[m]);

    }

    return ;

}