#include <iostream>
using namespace std;
int main(){

	int weigh=0,n=0,index=0;
	int a[10000];
	while(cin >>weigh){
		cin >>n;
		for(int i=0;i<n;i++)
			cin >> a[i];
		//冒泡排序  降序==================================
		for(int i=0;i<n;i++)
			for(int j=n-2;j>=i;j--)
			{
				if(a[j+1]>a[j]){
					index=a[j+1];
				a[j+1]=a[j];
				a[j]=index;}
			}
		for(int i=0;i<n&&weigh>0;){
			if(weigh-a[i]>=0)
				weigh=weigh-a[i];
			else
				i++;//只能往后找
		}
		if(weigh==0)
			cout <<"YES" <<endl;
		else//weigh >0的情况
			cout <<"NO" <<endl;
	}
	system("pause");
	return 0;
}