hdoj2191 //有点熟悉dp呢

#include<iostream>
#include<cstring>
#include<cstdio>
using namespace std;


int dp[105],p[105],w[105],d[105];


int main(){
int t,n,m;
cin>>t;
while(t--){
cin>>n>>m;
for (int i = 1; i <= m; i++)  
        {  
            cin>>p[i]>>w[i]>>d[i];  
        } 
memset(dp,0,sizeof(dp));
for(int i = 1;i<=m;++i){
for(int j = n;j>=0;--j){
for(int o = 1;o <= d[i];++o){
if(j >= o*p[i]) dp[j] = max(dp[j],dp[j-o*p[i]] + o*w[i]);
}
}
}
cout<<dp[n]<<endl;
}
return 0;
}