#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ios ios_base::sync_with_stdio(0);cin.tie(0);
template<typename A, typename B> ostream& operator<<(ostream &os, const pair<A, B> &p) { return os << '(' << p.first << ", " << p.second << ')'; }
template<typename T_container, typename T = typename enable_if<!is_same<T_container, string>::value, typename T_container::value_type>::type> ostream& operator<<(ostream &os, const T_container &v) { os << '{'; string sep; for (const T &x : v) os << sep << x, sep = ", "; return os << '}'; }
void dbg_out() { cerr << endl; }
template<typename Head, typename... Tail> void dbg_out(Head H, Tail... T) { cerr << ' ' << H; dbg_out(T...); }
#define dbg(...) cerr << "(" << #__VA_ARGS__ << "):", dbg_out(__VA_ARGS__);
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
inline int gen(int a, int b) {return (ll)rng() % (b - a + 1) + a;}
#define int ll
#define f first
#define s second
signed main()
{
ios
int s, n; cin >> s >> n;
vector<int> v(n), w(n), k(n);
vector<vector<pair<int, int>>> els(s + 1);
for(int i = 0, a, b, c; i < n; ++i) {
cin >> a >> b >> c;
if(b > s) continue;
els[b].emplace_back(a, c);
}
vector<vector<int>> items(s + 1);
for(int i = 1; i <= s; ++i) {
sort(els[i].rbegin(), els[i].rend());
int idx = 0;
while(items[i].size() < s && idx < (int)els[i].size()) {
items[i].push_back(els[i][idx].first);
--els[i][idx].second;
//dbg(els[i][idx].second)
if(els[i][idx].second <= 0) {
++idx;
}
}
}
auto max_self = [&](pair<int, int>& a, pair<int, int> b) {
if(a.f < b.f) a = b;
if(a.f == b.f && a.s > b.s) {
a = b;
}
};
vector<vector<pair<int, int>>> dp(s + 1, vector<pair<int, int>>(s + 1));
int mx = 0;
for(int i = 1; i <= s; ++i) {
for(int j = 0; j <= s; ++j) {
if(dp[i - 1][j].f > dp[i][j].f) {
dp[i][j] = {dp[i - 1][j].f, 0};
}
if(i + j <= s && dp[i][j].s < items[i].size()) {
max_self(dp[i][j + i], {dp[i][j].f + items[i][dp[i][j].s], dp[i][j].s + 1});
}
mx = max(mx, dp[i][j].f);
}
}
cout << mx << '\n';
}
