#include <bits/stdc++.h>
using namespace std;
#define FAST \
ios_base::sync_with_stdio(false); \
cin.tie(nullptr); \
cout.tie(nullptr);
#define ll long long
#define yn(tf) cout << (tf ? "YES\n" : "NO\n")
#define Endl endl
#define ld long double
const ld PI = 3.14159265359;
const ll MOD = 998244353;
const ll N = 1e5 + 7;
int s, n;
ll v[N], w[N], k[N];
ll mem[1000][2000];
ll fun(int i, int rem) {
if (rem < 0)
return -1e15;
if (i == n || rem == 0)
return 0;
ll &res = mem[i][rem];
if (res != -1)
return res;
res = fun(i + 1, rem);
for (int j = 1; j <= max(rem / w[i], k[i]); j++)
res = max(res, fun(i + 1, rem - j * w[i]) + v[i] * j);
return res;
}
int main() {
FAST
// #ifndef ONLINE_JUDGE
// freopen("in.txt", "r", stdin);
// // freopen("output.txt", "w", stdout);
// #endif
cin >> s >> n;
for (int i = 0; i < n; i++)
cin >> v[i] >> w[i] >> k[i];
memset(mem, -1, sizeof mem);
cout << fun(0, s);
return 0;
}
/*
*/
// BEFORE coding are you sure you understood the statement correctly?
// PLEASE do not forget to read the sample explanation carefully.
// WATCH out for overflows & RTs in general.
// TEST your idea or code on the corner cases.
// ANALYZE each idea you have thoroughly.
