#include <cstdio>
#include <algorithm>
using namespace std;

#define L_MAX 10000
#define N_MAX 10000

int L, N;
int W[N_MAX];
int dp[L_MAX + 1];

int main() {
	scanf("%d%d", &L, &N);
	for (int i = 0; i < N; i++) scanf("%d", W + i);
	
	for (int i = 0; i < N; i++) {
		for (int j = L; W[i] <= j; j--) {
			dp[j] = max(dp[j], dp[j - W[i]] + 1);
		}
	}
	
	int res = 0;
	for (int i = 1; i <= L; i++) res = max(res, dp[i]);
	
	printf("%d\n", res);
	
	return 0;
}