#include <iostream>
#include <stdio.h>
#include <string>
#include <cstring>
#include <set>
#include <queue>
#include <math.h>
#include <map>
#include <algorithm>
#include <stack>
#define ll long long
#define INF 0x3f3f3f3f
using namespace std;
const int maxn1=33000,maxn2=65;
int faux[maxn2][2];
int dp[maxn2][maxn1];
struct goods
{
int val,imp,num;
goods()
{
val=-1;
imp=-1;
num=-1;
}
goods(int val,int imp,int num):val(val),imp(imp),num(num) {}
} all[maxn2];
vector<goods>man;
int main()
{
// freopen("in.txt","r",stdin);
// freopen("out.txt","w",stdout);
memset(faux,0,sizeof faux);
memset(dp,0,sizeof dp);
man.push_back( goods(0,0,0) );//调整数据到1下标以上
int n,m,v,p,q;
cin>>n>>m;
for(int i=1; i<=m; i++)
{
scanf("%d%d%d",&v,&p,&q);
all[i]=goods(v,p,i);
if(q==0) //主件
{
man.push_back( goods(v,p,i) );
}
else
{
faux[q][0]==0?faux[q][0]=i:faux[q][1]=i;
}
}
// for(auto i:man)
// {
// cout<<i.val<<" "<<i.imp<<endl;
// }
int len=man.size()-1;
for(int i=1; i<=len; i++)
{
for(int j=1; j<=n; j++)
{
if( man[i].val>j )
{
dp[i][j]=dp[i-1][j];
// cout<<"第一 "<<i<<" "<<j<<" "<<dp[i][j]<<endl;
}
else
{
int aux1=-1,aux2=-1,aux12=-1,noaux=-1,onlyman=man[i].val*man[i].imp;
//只购买主件
noaux=dp[i-1][j-man[i].val]+onlyman;
//附件一存在&&可以和主件一起购买
int num_aux1=faux[ man[i].num ][0];
if( num_aux1!=0 && man[i].val+all[num_aux1].val<=j)
{
aux1=dp[i-1][j-man[i].val-all[num_aux1].val]+onlyman+all[num_aux1].val*all[num_aux1].imp;
}
//附件二存在&&只买附件二
int num_aux2=faux[ man[i].num ][1];
if( num_aux2!=0 && man[i].val+all[num_aux2].val<=j)
{
aux2=dp[i-1][j-man[i].val-all[num_aux2].val]+onlyman+all[num_aux2].val*all[num_aux2].imp;
}
//附件一二都存在&&都买
if( num_aux2!=0 && man[i].val+all[num_aux2].val+all[num_aux1].val<=j)
{
aux12=dp[i-1][j-man[i].val-all[num_aux1].val-all[num_aux2].val]+onlyman+all[num_aux1].val*all[num_aux1].imp+all[num_aux2].val*all[num_aux2].imp;
}
dp[i][j]=max( max( max( noaux, dp[i-1][j] ), max( aux1, aux2 ) ), aux12 );
// cout<<"第二 "<<i<<" "<<man[i].val<<" "<<j<<" "<<dp[i][j]<<endl;
// if(i==2 && j==40 )
// {
// cout<<"no = "<<noaux<<" aux1="<<aux1<<" aux2="<<aux2<<" aux12="<<aux12<<endl;
// }
}
}
}
cout<<dp[len][n]<<endl;
return 0;
}
dp[i][j]表示前i个物品在j元钱下的最优解。