#include <bits/stdc++.h>
using namespace std;
vector<vector<int>>dp;
int solve(int idx,int sum,vector<int>&v,vector<int>&w){
int n=v.size();
if(dp[idx][sum]!=0)return dp[idx][sum];
if(idx==n || sum==0)return 0;
int value1=solve(idx+1,sum,v,w);
int 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() {
int s,n;
cin>>s>>n;
vector<int>v;
vector<int>w;
for(int i=0;i<n;i++){
int 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);
}
}
dp.assign(n+1,vector<int>(s+1,0));
cout<<solve(0,s,v,w)<<endl;
}
