#include <bits/stdc++.h>
using namespace std;
#define int long long
// #define endl '\n'
#define ff first
#define ss second
#define pb push_back
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define ar array
const int MOD = 1e9 + 7,INF = 1e18, N = 2e5 + 5;
/*
5 2
1 2 2
2 3 2
3 4 2
4 5 2
*/
void solve(){
int s , n;
cin >> s >> n;
vector <int> v(n) , w(n) , k(n);
int sum = 0;
for(int i = 0;i < n;i++){
cin >> v[i] >> w[i] >> k[i];
sum += w[i] * k[i];
}
sum = min(s, sum);
vector <int> dp(sum + 1, 0);
vector <int> use(sum + 1);
use[0] = 1;
for(int i = 0;i < n;i++){
for(int z = sum; z >= w[i];z--){
if(use[z - w[i]]){
dp[z] = max(dp[z] , dp[z - w[i]] + v[i]);
use[z] = 1;
}
}
}
int ans = 0;
for(int i = 0;i <= sum;i++){
if(dp[i] != INF){
ans = max(ans , dp[i]);
}
}
cout<<ans<<endl;
}
signed main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
int ti = 1;
while (ti--) {
solve();
}
}
