#include <bits/stdc++.h>
#define file "main"
#define maxn (int) 3e6 + 5
#define ll long long
#define pii pair<ll, int>
#define fi(i, a, b) for(int i = a; i <= b; i ++)
#define fid(i, a, b) for(int i = a; i >= b; i --)
using namespace std;
int S, n, N;
pii a[maxn];
ll dp[2005];
int main() {
// freopen(file".inp", "r", stdin);
ios::sync_with_stdio(false);
cin.tie(0);
cin >> S >> n;
fi(i, 1, n) {
int v, w, k; cin >> v >> w >> k;
for(int tmp = 1; tmp <= k; tmp *= 2) {
int nw_v = v * tmp, nw_w = w * tmp;
if(nw_w <= S) a[++N] = { nw_v, nw_w };
k -= tmp;
}
if(k) {
int nw_v = v * k, nw_w = w * k;
if(nw_w <= S) a[++N] = { nw_v, nw_w };
}
}
memset(dp, -0x3f, sizeof dp);
dp[0] = 0;
fi(i, 1, N) {
fid(j, S, a[i].second) {
dp[j] = max(dp[j], dp[j - a[i].second] + a[i].first);
}
}
cout << *max_element(dp + 0, dp + S + 1);
return 0;
}
