#include <bits/stdc++.h>
#define ll long long
#define fi first
#define se second
#define sz(x) (int)x.size()
#define ALL(v) v.begin(),v.end()
#define MASK(k) (1LL << (k))
#define BIT(x, i) (((x) >> (i)) & 1)
#define oo (ll)1e18 + 10
#define INF (ll)1e9
#define MOD (ll)(1e9 + 7)
using namespace std;
template<class T1, class T2>
bool maximize(T1 &a, T2 b){if(a < b){a = b; return true;} return false;}
template<class T1, class T2>
bool minimize(T1 &a, T2 b){if(a > b){a = b; return true;} return false;}
template<class T1, class T2>
void add(T1 &a, T2 b){a += b; if(a >= MOD) a -= MOD;}
template<class T1, class T2>
void sub(T1 &a, T2 b){a -= b; if(a < 0) a += MOD;}
template<class T>
void cps(T &v){sort(ALL(v)); v.resize(unique(ALL(v)) - v.begin());}
const int MAX = 2003;
int S, N;
vector<pair<int, int>> items[MAX];
ll dp[MAX];
void solve(){
cin >> S >> N;
for(int i = 1; i <= N; i++){
int v, w, k; cin >> v >> w >> k;
items[w].push_back(make_pair(v, k));
}
clock_t start = clock();
memset(dp, -0x3f, sizeof dp);
dp[0] = 0;
for(int t = 0; t <= S; t++){
if(items[t].empty()) continue;
sort(ALL(items[t]), [&](pair<int, int> a, pair<int, int> b){return a.fi > b.fi;});
int i = 0;
for(int rep = 1; rep <= S / t; rep++){
for(int j = S; j >= t; j--){
maximize(dp[j], dp[j - t] + items[t][i].fi);
}
if(--items[t][i].se == 0) i++;
if(i == sz(items[t])) break;
}
}
cout << *max_element(dp, dp + S + 1) << '\n';
cerr << "Time elapsed: " << clock() - start << " ms\n";
}
int main(){
ios_base::sync_with_stdio(0); cin.tie(0);
// freopen("bdbang.inp","r",stdin);
// freopen("bdbang.out","w",stdout);
int t = 1;
// cin >> t;
while(t--)
solve();
return 0;
}
