#include<bits/stdc++.h>
using namespace std;
void DBG() { cerr << "]\n"; }
template<class H, class... T> void DBG(H h, T... t) {
cerr << h; if(sizeof...(t)) cerr << ", ";
DBG(t...);
}
#ifdef LOCAL
#define dbg(...) cerr << "[" << #__VA_ARGS__ << "]: [", DBG(__VA_ARGS__)
#else
#define dbg(...) 0
#endif // LOCAL
#define FOR(i,a,b) for(int i = (a) ; i<(b) ; i++)
#define F0R(i,a) FOR(i,0,a)
#define ROF(i,a,b) for(int i = (b)-1 ; i>=(a) ; i--)
#define R0F(i,a) ROF(i,0,a)
#define each(e,a) for(auto &e : (a))
#define sz(v) (int)(v).size()
#define all(v) (v).begin(),(v).end()
#define rall(v) (v).rbegin(),(v).rend()
#define pb push_back
#define tcT template<class T
#define nl "\n"
using ll = long long;
using vi = vector<int>;
using pi = pair<int,int>;
using str = string;
tcT> using V = vector<T>;
tcT> using pqg = priority_queue<T,vector<T>,greater<T>>;
void setIO(string NAME = "") {
cin.tie(0)->sync_with_stdio(0);
if(sz(NAME)) {
freopen((NAME + ".inp").c_str(),"r",stdin);
freopen((NAME + ".out").c_str(),"w",stdout);
}
}
tcT> bool ckmax(T&a, const T&b) {
return b > a ? a = b, 1 : 0;
}
const int MX = 2001;
const ll INF = 1e18;
int S, N;
V<pi> items[MX];
ll dp[MX+5][MX];
void solve() {
cin>>S>>N;
F0R(i,N) {
int V, W, K;
cin>>V>>W>>K;
items[W].pb({V, K});
}
memset(dp, -0x3f, sizeof dp);
dp[0][0] = 0;
FOR(i,1,MX) {
sort(rall(items[i]));
F0R(j,MX) {
dp[i][j] = dp[i-1][j];
ll val = 0;
for(int amt = 0, pt = 0, used = 0; j-i*(amt+1) >= 0 && pt < sz(items[i]); ) {
amt++;
val += items[i][pt].first;
if(dp[i-1][j-i*amt] >= 0) {
ckmax(dp[i][j], dp[i-1][j-i*amt] + val);
}
used++;
if(used == items[i][pt].second) {
used = 0;
pt++;
}
}
}
}
ll ans = -INF;
F0R(i, S+1) ckmax(ans, dp[MX-1][i]);
cout << ans << nl;
}
int main() {
setIO();
int t=1;
//cin>>t;
while(t-->0) {
solve();
}
return 0;
}
