/*
Author: baodat
※\(^o^)/※
Current goal: Training for VNOI shirt
*/
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define FOR(i, l, r) for(int i = l; i <= r; i++)
#define FORD(i, l, r) for(int i = l; i >= r; i--)
#define db double
#define ldb long double
#define all_1(x) (x).begin() + 1, (x).end()
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define ins insert
#define pb push_back
template<typename T>void debug_var(const T& var, const string& name){
cerr << name << ": " << var << "\n";
}
template<typename T>void debug_1d(const T& vt, const string& name){
if(vt.empty()){
cerr << name << " is empty!\n";
return;
}
FOR(i, 0, (int)vt.size() - 1){
cerr << name << "[" << i << "]: " << vt[i] << "\n";
}
}
const ll oo = 2e18;
void solve(){
int S, n;
cin >> S >> n;
vector<pair<int, int>> items;
vector<vector<pair<int, int>>> group(S + 1);
FOR(i, 1, n){
int w, v, k;
cin >> v >> w >> k;
group[w].pb({v, k});
}
FOR(w, 1, S){
if(group[w].empty()) continue;
sort(all(group[w]), [&](pair<int, int> a, pair<int, int> b){
return a.first > b.first || (a.first == b.first && a.second > b.second);
});
int lim = S / w;
for(auto[v, k] : group[w]){
int take = min(lim, k);
FOR(j, 1, take) items.pb({v, w});
lim -= take;
if(lim <= 0) break;
}
}
vector<ll>dp(S + 1);
for(auto [v, w] : items){
FORD(j, S, w) dp[j] = max(dp[j], dp[j - w] + v);
}
cout << *max_element(all(dp)) << "\n";
}
signed main(){
ios_base::sync_with_stdio(0);
cin.tie(0);
int t = 1;
//cin >> t;
while(t--){
solve();
}
return 0;
}
