#include <bits/stdc++.h>
using namespace std;
vector<vector<long long>>dp;
long long solve(long long idx,long long sum,vector<long long>&v,vector<long long>&w){
long long n=v.size();
if(idx==n || sum==0)return 0;
if(dp[idx][sum]!=-1)return dp[idx][sum];
long long value1=solve(idx+1,sum,v,w);
long long value2=0;
if(w[idx]<=sum){
value2=v[idx] + solve(idx+1,sum-w[idx],v,w);
}
return dp[idx][sum]=max(value1,value2);
}
int main() {
long long s,n;
cin>>s>>n;
vector<long long>v;
vector<long long>w;
for(int i=0;i<n;i++){
long long v1,w1,k1;
cin>>v1>>w1>>k1;
for(int j=1;j<=k1;j*=2){
v.push_back(v1*j);
w.push_back(w1*j);
k1-=j;
}
if(k1>0){
v.push_back(v1*k1);
w.push_back(w1*k1);
}
}
n=v.size();
dp.assign(n+1,vector<long long>(s+1,-1));
cout<<solve(0,s,v,w)<<endl;
}
