#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("mmx,sse,sse2,sse3")
#include "bits/stdc++.h"
using namespace std;
#define INF 2000000100
#define INFLL 1000000000000000000ll
#define EPS 1e-9
#define all(x) x.begin(),x.end()
#define rall(x) x.rbegin(),x.rend()
#define pb push_back
#define fi first
#define sc second
using i64 = long long;
using u64 = unsigned long long;
using ld = long double;
using ii = pair<int, int>;
const int N = 2e3 + 100;
int dp[N];
ii dq[N];
void solve() {
int s, n;
cin >> s >> n;
fill(dp, dp + N, -INF);
dp[0] = 0;
for(int i = 0; i < n; ++i) {
int v, w, c;
cin >> v >> w >> c;
c = min(c, s / w);
for(int k = 0; k < w; ++k) {
int lo = 0, hi = 0;
for(int j = 0; k + w * j <= s; ++j) {
int X = dp[k + w * j];
while(lo < hi && j - dq[lo].sc > c) ++lo;
if(lo != hi) dp[k + w * j] = max(dp[k + w * j], dq[lo].fi + v * j);
if(X >= 0) {
while(lo < hi && dq[hi - 1].fi < X - v * j) --hi;
dq[hi++] = {X - v * j, j};
}
}
}
}
cout << *max_element(dp, dp + N) << '\n';
}
int main() {
ios_base :: sync_with_stdio(false);
cin.tie(0);
int t = 1;
// cin >> t;
while(t--) solve();
return 0;
}
