#include <bits/stdc++.h>
#define vi vector<int>
#define ve vector
#define ll long long
#define vl vector<ll>
#define vll vector<pair<ll,ll>>
#define ii pair<int,int>
#define vvi vector<vi>
#define vii vector<ii>
#define gii greater<ii>
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define INF 1e9
#define eps 1e-7
#define eps1 1e-2
#define optimise ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
#define MAX_A 1e5+5
using namespace std;
const int MOD = 1e9+7;
const int nax = 1e2+5;
double PI=3.14159265359;
int arx[8]={1,1,0,-1,-1,-1, 0, 1};
int ary[8]={0,1,1, 1, 0,-1,-1,-1};
typedef complex<int> Point;
#define X real()
#define Y imag()
void setIO(string s) {
freopen((s + ".in").c_str(), "r", stdin);
freopen((s + ".out").c_str(), "w", stdout);
}
ll n,k;
ll value[nax],weight[nax],number[nax];
ll dp[nax][2005];
ll search(int x,int z){
if (z>k) return -1e18;
if (x==n) return 0;
if (dp[x][z]!=-1) return dp[x][z];
dp[x][z]=0;
for (int i = 0; i <= number[x]; ++i)
{
dp[x][z]=max(dp[x][z],value[x]*(i)+search(x+1,z+weight[x]*(i)));
}
//cout << dp[x][z]<<endl;
return dp[x][z];
}
int main(){
optimise;
/*#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif*/
//setIO("feast");
cin>>k>>n;
//cout << n<<endl;
memset(dp,-1,sizeof dp);
for (int i = 0; i < n; ++i)
{
cin>>value[i]>>weight[i]>>number[i];
}
cout << search(0,0)<<endl;
}
