#include <stdio.h>
#include<algorithm>
#include<math.h>
#include<iostream>
using namespace std;

int dp[101][101];
int time[101];
int mo[101];

int main() {

	int t, m;
	cin >> t >> m;
	for (int i = 0; i < m; i++) {
		cin >> time[i] >> mo[i];
	}
	for (int i = 0; i < m; i++) {
		for (int j = 0; j < t; j++) {
			if (j < mo[i]) {
				dp[i][j] = dp[i - 1][j];
			}
			else {
				dp[i][j] = max(dp[i - 1][j], dp[i - 1][j - time[i]] + mo[i]);
			}
		}
	}
	cout << dp[m][t];

	return 0;
}