#include <bits/stdc++.h>
#ifdef DEBUG
#include "debug.hpp"
#endif
using namespace std;
#define all(c) (c).begin(), (c).end()
#define rall(c) (c).rbegin(), (c).rend()
#define traverse(c, it) for(auto it = (c).begin(); it != (c).end(); ++it)
#define rep(i, N) for(int i = 0; i < (N); ++i)
#define rrep(i, N) for(int i = (N) - 1; i >= 0; --i)
#define rep1(i, N) for(int i = 1; i <= (N); ++i)
#define rep2(i, s, e) for(int i = (s); i <= (e); ++i)
#ifdef DEBUG
#define debug(x...) { \
++dbg::depth; \
string dbg_vals = dbg::to_string(x); \
--dbg::depth; \
dbg::fprint(__func__, __LINE__, #x, dbg_vals); \
}
#define light_debug(x) { \
dbg::light = true; \
dbg::dout << __func__ << ":" << __LINE__; \
dbg::dout << " " << #x << " = " << x << endl; \
dbg::light = false; \
}
#else
#define debug(x...) 42
#define light_debug(x) 42
#endif
using ll = long long;
template<typename T>
inline T& ckmin(T& a, T b) { return a = a > b ? b : a; }
template<typename T>
inline T& ckmax(T& a, T b) { return a = a < b ? b : a; }
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
int s, n; cin >> s >> n;
vector<vector<pair<int, int>>> best(s + 1);
rep(_, n) {
int v, w, k; cin >> v >> w >> k;
best[w].push_back({v, k});
}
rep1(w, s) {
sort(all(best[w]), greater<pair<int, int>>());
int c{s / w};
for(auto i = best[w].begin(); i != best[w].end(); ++i) {
if(c >= i->second) c -= i->second;
else {
i->second = c;
best[w].erase(i + 1, best[w].end());
break;
}
}
}
debug(best);
vector<long long> dp(s + 1, -1); dp[0] = 0;
rep1(w, s) {
for(auto [v, k] : best[w])
for(int i{1}; i <= k; i++)
for(int x{s - w}; x >= 0; --x)
if(~dp[x]) ckmax(dp[x + w], dp[x] + v);
}
cout << *max_element(all(dp)) << '\n';
#ifdef DEBUG
dbg::dout << "\nExecution time: "
<< clock() * 1000 / CLOCKS_PER_SEC
<< "ms" << endl;
#endif
return 0;
}
