# include <bits/stdc++.h>
# define int long long
using namespace std;
const int N=1e5+5;
int dp[N],n,m,w[N];
signed main(){
	cin>>m>>n;
	for(int i = 1;i<=n;i++)
		cin>>w[i];
	for(int i = 1;i<=n;i++)
		for(int j = m;j>=w[i];j--)
				dp[j]=max(dp[j],dp[j-w[i]]+w[i]); 
	cout<<dp[m];
	return 0;
}

#include <bits/stdc++.h> using namespace std;

int n, V; int v[1005], w[1005], s[1005];

int main() { cin >> n >> V; for(int i = 1; i <= n; i++){ cin >> v[i] >> w[i] >> s[i]; }

int dp[V + 5] = {0};
for(int i = 1; i <= n; i++){
    if(s[i] == -1){ 
        for(int j = V; j >= v[i]; j--){
            dp[j] = max(dp[j], dp[j - v[i]] + w[i]);
        }
    }else if(s[i] == 0){
        for(int j = v[i]; j <= V; j++){
            dp[j] = max(dp[j], dp[j - v[i]] + w[i]);
        }
    }else{
        for(int k = 1; k <= s[i]; k++){
            for(int j = V; j >= v[i]; j--){
                dp[j] = max(dp[j], dp[j - v[i]] + w[i]);
            }
        }
    }
}

cout << dp[V] << endl;
return 0;

}