#include <bits/stdc++.h>
#pragma GCC optimize("Ofast,unroll-loops")
#define bupol __builtin_popcount
#define int long long
#define ll long long
#define ld long double
#define fi first
#define se second
#define pb push_back
#define lf (id<<1)
#define rg ((id<<1)|1)
#define md ((l+r)>>1)
using namespace std;
const int MAXN = 1e5+10;
const int MAXK = 2010;
const int LOG = 20;
const int MOD = 1e9+7;
const int SQRT = 520;
const int INF = 1e18;
typedef pair<int,int> pii;
typedef pair<int,pii> ipii;
int n, s;
int v[MAXN], w[MAXN], k[MAXN];
int dp[MAXN][MAXK];
signed main(){
ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
cin >> s >> n;
for(int i=1; i<=n; i++){
cin >> v[i] >> w[i] >> k[i];
}
for(int i=1; i<=n; i++)
for(int j=0; j<=s; j++) dp[i][j] = -INF;
for(int i=1; i<=n; i++){
for(int j=0; j<=s; j++){ // max value kalo udh di i, isinya j
dp[i][j] = dp[i-1][j];
for(int x=1; x<=min(k[i], j/w[i]); x++){
dp[i][j] = max(dp[i][j], dp[i-1][j - x*w[i]] + x*v[i]);
}
}
// for(int j=0; j<w[i]; j++){ // x % w[i] == j
// int cnt = 0;
// for(int x=1; x<=s/w[i]+1; x++){
// int num = w[i]*x+j;
// if(num > s) break;
// dp[i][]
// }
// if(j >= w[i]){
// dp[i][j] = max(dp[i][j], dp[i-1][j-w[i]] + v[i]);
// }
// }
}
int mx = -INF;
for(int i=0; i<=s; i++) mx = max(mx, dp[n][i]);
cout << mx << '\n';
}
