#include <bits/stdc++.h>
#define ll long long
#define ii pair <int, int>
#define ill pair <ll, ll>
#define fi first
#define se second
#define all(x) x.begin(), x.end()
#define file "test"
using namespace std;
const int N = 1e5 + 5;
const int MOD = 1e9 + 7;
const ll INF = 1e18;
const int base = 311;
const int BLOCK_SIZE = 2000;
ll n, m, v[N], w[N], k[N], f[N][2005];
vector <int> decompose(int x) {
int t = 1;
vector <int> res;
while (x > t) {
res.push_back(t);
x -= t, t *= 2;
}
res.push_back(x);
return res;
}
int main() {
ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
// #ifndef ONLINE_JUDGE
// freopen(file".inp","r",stdin); freopen(file".out","w",stdout);
// #endif
cin >> m >> n;
for (int i = 1; i <= n; i ++) {
cin >> v[i] >> w[i] >> k[i];
vector <int> b = decompose(k[i]);
for (auto k: b)
for (int j = m; j >= k * w[i]; j --)
f[i][j] = max(f[i][j], max(f[i][j - k * w[i]], f[i - 1][j - k * w[i]]) + k * v[i]);
for (int j = 1; j <= m; j ++)
f[i][j] = max(f[i][j], f[i - 1][j]);
}
cout << f[n][m];
}
