#include <iostream>
#include <sstream>
#include <math.h>
#include <stack>
#include <set>
#include <algorithm>
#include <string>
#include <queue>
#include <stack>
#include <map>
#include <cstdio>
#include <vector>
using namespace std;

#define INF (1 << 30)
#define INFLL (1LL << 60)

int l,n,w[10001];
int memo[10010][10010];

int saiki(int nokori,int now){
	if(memo[nokori][now] != INF) return memo[nokori][now];
	if(now == n) return 0;
	int a = 0,b = 0;
	if(nokori - w[now] >= 0) a += saiki(nokori - w[now],now + 1) + 1;
	b += saiki(nokori,now + 1);
	return memo[nokori][now] = max(a,b);
}

int main() {
	for(int i = 0;i < 10010;i++){
		for(int j = 0;j < 10010;j++){
			memo[i][j] = INF;
		}
	}
	cin >> l >> n;
	for(int i = 0;i < n;i++){
		cin >> w[i];
	}
	cout << saiki(l,0) << endl;
	return 0;
}