#include <bits/stdc++.h>
#define int int64_t
//#pragma GCC optimize("Ofast")
#define f first
#define s second
#define pb push_back
#define opt1 ios_base::sync_with_stdio(false)
#define opt2 cin.tie(NULL)
#define optimize opt1; opt2
#define endl "\n"
#define sz(v) (int)v.size()
using namespace std;
typedef pair<int, int> ii;
typedef pair<int, ii> i3;
typedef pair<ii, ii> i4;
typedef vector<int> vi;
typedef vector<ii> vii;
typedef vector<i3> vi3;
typedef vector<i4> vi4;
const int inf = 0x7f6f6f6f;
const int MAX = 2005;
const int mod = 998244353;
int dp[MAX];
i3 a[100005];
vector <vi> adj;
int32_t main () {
optimize;
int S, n;
cin >> S >> n;
for (int i = 1; i <= n; i++)
cin >> a[i].f >> a[i].s.f >> a[i].s.s;
adj.resize(S+1);
sort(a+1, a+n+1, greater<i3>());
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= a[i].s.s; j++) {
if (sz(adj[a[i].s.f]) >= S/a[i].s.f)
break;
adj[a[i].s.f].pb(a[i].f);
}
}
for (int i = 1; i <= S; i++)
dp[i] = -inf;
for (int i = 1; i <= S; i++) {
for (int x = S; x > 0; x--) {
int curr = x, sum = 0, j = 0;
while (j < sz(adj[i]) && curr >= i) {
curr -= i;
sum += adj[i][j];
j++;
dp[x] = max(dp[x], dp[curr]+sum);
}
}
}
int ans = 0;
for (int i = 1; i <= S; i++)
ans = max(ans, dp[i]);
cout << ans << endl;
return 0;
}
/*
passa!
*/
