#include<bits/stdc++.h>
using namespace std;
#define f first
#define ll long long
#define endl "\n"
#define s second
#define pii pair<int,int>
#define pppiiii pair<pii,pii>
#define ppii pair<pii,int>
#define pll pair<ll,ll>
#define ppll pair<ll,pair<ll,ll>>
#define pbb pair<bool,bool>
#define fastio ios::sync_with_stdio(false);cin.tie(NULL);
const int mxn=1e5+1;
#define int long long
int32_t main(){
fastio
int s,n;cin>>s>>n;
vector<pair<pair<ll,ll>,ll>>v(n+1);
vector<vector<pair<ll,ll>>>dp(n+1,vector<pair<ll,ll>>(s+1,{0,0}));
for(int i=1;i<=n;i++)cin>>v[i].f.f>>v[i].f.s>>v[i].s,v[i].s--;
//val, weight, how many
ll ans=0;
for(int i=1;i<=n;i++){
for(int j=1;j<=s;j++){
dp[i][j].s=v[i].s;
dp[i][j].f=dp[i-1][j].f;
if(j-v[i].f.s>=0){
dp[i][j].f=max(dp[i][j].f,dp[i-1][j-v[i].f.s].f+v[i].f.f);
if(dp[i][j].f<dp[i][j-v[i].f.s].f+v[i].f.f&&dp[i][j-v[i].f.s].s>0){
dp[i][j].f=dp[i][j-v[i].f.s].f+v[i].f.f;
dp[i][j].s=dp[i][j-v[i].f.s].s-1;
}
}
ans=max(ans,dp[i][j].f);
}
}
cout<<ans<<'\n';
}
