#include <bits/stdc++.h>
#include <string>
#include <iostream>
#include <cmath>
#include <numeric>
#include <stack>
#include <queue>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef pair<int, int> pi;
typedef pair<ll, ll> pl;
typedef pair<ld, ld> pd;
typedef vector<int> vi;
typedef vector<bool> vb;
typedef vector<vector<int>> vvi;
typedef vector<vector<pi>> vvpi;
typedef vector<ld> vd;
typedef vector<long> vl;
typedef vector<pi> vpi;
typedef vector<pl> vpl;
#define FOR(i, a, b) for (int i = a; i < (b); i++)
#define F0R(i, a) for (int i = 0; i < (a); i++)
#define FORd(i, a, b) for (int i = (b)-1; i >= a; i--)
#define F0Rd(i, a) for (int i = (a)-1; i >= 0; i--)
#define trav(a, x) for (auto &a : x)
#define uid(a, b) uniform_int_distribution<int>(a, b)(rng)
#define len(x) (int)(x).size()
#define mp make_pair
#define pb push_back
#define F first
#define nl endl
#define S second
#define lb lower_bound
#define ub upper_bound
#define aint(x) x.begin(), x.end()
#define raint(x) x.rbegin(), x.rend()
#define ins insert
const int MOD = 1e9+5;
void init(string name)
{
freopen((name + ".in").c_str(), "r", stdin);
freopen((name + ".out").c_str(), "w", stdout);
}
void fastIO()
{
ios_base::sync_with_stdio(0);
cin.tie(0);
}
int s,n;
vi V,W,K;
void solve()
{
cin >> s >> n;
V = vi(n);
W = vi(n);
K = vi(n);
FOR(i,0,n)cin >> V[i] >> W[i] >> K[i];
vi dpA(s+1,0);
int dp[s+1][n];
FOR(i,0,s+1){
FOR(j,0,n){
dp[i][j] = K[j];
}
}
FOR(i,0,s+1){
FOR(j,0,n){
if(dp[i][j] == 0)continue;
if(i+W[j]>s)continue;
if(dpA[i+W[j]] < dpA[i] + V[j]){
dpA[i+W[j]] = dpA[i] + V[j];
FOR(k,0,n){
dp[i+W[j]][k] = dp[i][k];
}
dp[i+W[j]][j] --;
}
}
}
int ans = 0;
FOR(i,0,s+1){
ans = max(ans,dpA[i]);
}
cout << ans << endl;
}
int main()
{
fastIO();
// init("test");
int t = 1;
// cin >> t;
while (t--)
solve();
return 0;
}
