#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <tr2/dynamic_bitset>
using namespace std;
using namespace __gnu_pbds;
using namespace tr2;
#define ar array
#define vt vector
#define pq priority_queue
#define pu push
#define pub push_back
#define em emplace
#define emb emplace_back
#define mt make_tuple
#define all(x) x.begin(), x.end()
#define allr(x) x.rbegin(), x.rend()
#define allp(x, l, r) x.begin() + l, x.begin() + r
#define len(x) (int)x.size()
#define uniq(x) unique(all(x)), x.end()
using ll = long long;
using ld = long double;
using ull = unsigned long long;
template<class Fun> class y_combinator_result {
Fun fun_;
public:
template<class T> explicit y_combinator_result(T &&fun): fun_(std::forward<T>(fun)) {}
template<class ...Args> decltype(auto) operator()(Args &&...args) { return fun_(std::ref(*this), std::forward<Args>(args)...); }
};
template<class Fun> decltype(auto) y_combinator(Fun &&fun) { return y_combinator_result<std::decay_t<Fun>>(std::forward<Fun>(fun)); }
template <class T, size_t N>
void re(array <T, N>& x);
template <class T>
void re(vt <T>& x);
template <class T>
void re(T& x) {
cin >> x;
}
template <class T, class... M>
void re(T& x, M&... args) {
re(x), re(args...);
}
template <class T>
void re(vt <T>& x) {
for(auto& it : x) re(it);
}
template <class T, size_t N>
void re(array <T, N>& x) {
for(auto& it : x) re(it);
}
template <class T, size_t N>
void wr(const array <T, N>& x);
template <class T>
void wr(const vt <T>& x);
template <class T>
void wr(const T& x) {
cout << x;
}
template <class T, class ...M>
void wr(const T& x, const M&... args) {
wr(x), wr(args...);
}
template <class T>
void wr(const vt <T>& x) {
for(auto it : x) wr(it, ' ');
}
template <class T, size_t N>
void wr(const array <T, N>& x) {
for(auto it : x) wr(it, ' ');
}
template<class T, class... M>
auto mvt(size_t n, M&&... args) {
if constexpr(sizeof...(args) == 1)
return vector<T>(n, args...);
else
return vector(n, mvt<T>(args...));
}
void set_fixed(int p = 0) {
cout << fixed << setprecision(p);
}
void set_scientific() {
cout << scientific;
}
void Open(const string& name) {
#ifndef ONLINE_JUDGE
(void)!freopen((name + ".in").c_str(), "r", stdin);
(void)!freopen((name + ".out").c_str(), "w", stdout);
#endif
}
void solve() {
int x, n; re(x, n);
vt <ll> dp(x + 1);
vt <int> h(n), s(n), k(n);
map <int, vt <ar <int, 2>>> H;
for (int i = 0; i < n; ++i) {
re(s[i], h[i], k[i]);
H[h[i]].pub({k[i], s[i]});
}
dp[0] = 0;
int nrit = 7000;
for (auto& [h, v] : H) {
if (h > x)
break;
sort(all(v));
for (auto& [k, s] : v) {
if (--nrit < 0) break;
int curr = k;
for (int j = 0; (1 << j) <= curr; ++j) {
ll tot = (ll)h * (1 << j);
ll nrp = (ll)s * (1 << j);
for (int j = x; j >= tot; --j)
dp[j] = max(dp[j], dp[j - tot] + nrp);
curr -= (1 << j);
}
if (curr > 0) {
ll tot = (ll)h * curr;
ll nrp = (ll)s * curr;
for (int j = x; j >= tot; --j)
dp[j] = max(dp[j], dp[j - tot] + nrp);
}
}
if (nrit < 0) break;
}
wr(*max_element(all(dp)), '\n');
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
//Open("");
int t = 1;
for(;t;t--) {
solve();
}
return 0;
}
