#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define sz(x) (int)x.size()
const int MAX = 1e5;
array<ll, 3> items[MAX]; // V, W, K
ll dp[2001]; // best V for each W
int main() {
ios_base::sync_with_stdio(false); cin.tie(nullptr);
int S, N; cin >> S >> N;
for (int i = 0; i < N; ++i) {
cin >> items[i][0];
cin >> items[i][1];
cin >> items[i][2];
}
/*
for (int i = 0; i < N; ++i) {
cout << items[i][2] << " ";
}
*/
for (int i = 0; i < N; ++i) {
for (int pos = S; pos >= 0; --pos) {
int max_items = min((ll)(S - pos) / items[i][1], items[i][2]);
for (int j = 0; j <= max_items; ++j) {
dp[pos + j * items[i][1]] = max(dp[pos + j * items[i][1]], dp[pos] + items[i][0] * j);
}
}
}
ll ans = 0;
for (int i = 0; i <= S; ++i) {
ans = max(ans, dp[i]);
}
cout << ans << '\n';
}
