#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vll = vector<ll>;
#define f0r(i,n) for(ll i = 0; i<(ll)(n); i++)
int main(){
ll capacity,n;
cin>>capacity>>n;
ll value[n], weight[n], quantity[n];
f0r(i,n) cin>>value[i]>>weight[i]>>quantity[i];
ll dp[capacity+1]; // in theory: dp[n+1][capacity+1]; but made 1D for memory saving
ll nextDp[capacity+1]; // AUXILIARY FOR TEMPORARILY HOLDING EDITS TO DP
f0r(j,capacity+1) dp[j] = 0; // initial row with nothing considered
f0r(i,n){
// considering item i
f0r(j,capacity+1){
ll limit = min((capacity-j)/weight[i],quantity[i]);
nextDp[j] = max(dp[j],dp[j+limit*weight[i]]+limit*value[i]);
}
f0r(j,capacity+1){
dp[j] = nextDp[j];
// cout<<setw(5)<<dp[j];
}
// cout<<"\n";
}
cout<<dp[0];
}
