1 #include <iostream>
 2 #include <cstdio>
 3 #include <cstring>
 4 
 5 using namespace std;
 6 
 7 int Max(int a,int b)
 8 {
 9     return a>b?a:b;
10 }
11 
12 int main ()
13 {
14     int t,dp[5010];
15     scanf("%d",&t);
16 
17     while (t--)
18     {
19         memset(dp,0,sizeof(dp));
20         int n,m;
21         int p[210],h[210],c[210];
22         scanf("%d%d",&n,&m);
23         for (int i=0; i<m; i++)
24         {
25 
26             scanf("%d%d%d",&p[i],&h[i],&c[i]);
27         }
28         for (int i=0; i<m; i++)
29         {
30             for (int j=1; j<=c[i]; j++)
31             {
32                 for (int k=n; k>=p[i]; k--)
33                 {
34                     dp[k]=Max(dp[k],dp[k-p[i]]+h[i]);
35                 }
36             }
37         }
38         printf ("%d\n",dp[n]);
39     }
40     return 0;
41 }