#include <iostream>
#include<algorithm>
using namespace std;
int w[10000];
int l,n;

int s(int le,int a)
{
	if(le<0)return -1;
	if(a>=n)return 0;
	return max(s(le-w[a],a+1)+1,s(le,a+1));
}

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