#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef struct {bool unlimited; ll w, t;} platedata;
vector<platedata> plates;
vector<ll> dpOld;
vector<ll> dpNew;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
int l, k;
cin >> l >> k;
plates.reserve(k);
while (k--) {
ll n, w, t;
cin >> w >> t >> n;
if ((n+1) * t > l) {
// We have effectively infinity of these plates
plates.push_back({true, w, t});
} else {
// Fuse plates into powers of 2 for efficiency
int used = 0;
for (int mult = 1; mult * 2 <= n; mult *= 2) {
used += mult;
plates.push_back({false, w*mult, t*mult});
}
int finalMult = n - used;
plates.push_back({false, w*finalMult, t*finalMult});
}
}
dpOld.resize(l+1);
for (auto [unlimited, w, t] : plates) {
dpNew.clear();
dpNew.push_back(0);
for (int j = 1; j <= l; j++) {
ll bestimate = dpOld[j];
if (t <= j) {
vector<ll> &smallerCase = unlimited ? dpNew : dpOld;
bestimate = max(bestimate, smallerCase[j-t] + w);
}
dpNew.push_back(bestimate);
}
dpOld = dpNew;
}
cout << dpOld[l] << endl;
return 0;
}
