    import java.util.Scanner;
     
    public class Main {
        static int binarySearchRightMost(int arr[],int key){
            int l=0,r=arr.length-1;
            while (l<r){
                int mid=Math.floorDiv(l+r,2);
                if(arr[mid]>key){
                    r=mid;
                }
                else{
                    l=mid+1;
                }
            }
            return r-1;
     
        }
     
        public static void main(String[] args) {
    //        int arr[]={1,2,3,4,4,4,6,7};
    //        System.out.println(binarySearchRightMost(arr,4));
            Scanner scanner=new Scanner(System.in);
            int a=scanner.nextInt();
            int b=scanner.nextInt();
    //        int arr[]=new int[b];
            for(int j=0;j<b;j++){
                a-=scanner.nextInt();
                if(a<=0){
                    System.out.println("Yes");
                    break;
                }
            }
            if(a>0){
                System.out.println("No");
            }
    //        System.out.println(a%b==0?Math.floorDiv(a,b):Math.floorDiv(a,b)+1);
        }
    } import java.util.Scanner; Scanner java.util public class Main {
        static int binarySearchRightMost(int arr[],int key){
            int l=0,r=arr.length-1;
            while (l<r){
                int mid=Math.floorDiv(l+r,2);
                if(arr[mid]>key){
                    r=mid;
                }
                else{
                    l=mid+1;
                }
            }
            return r-1;
     
        }
     
        public static void main(String[] args) {
    //        int arr[]={1,2,3,4,4,4,6,7};
    //        System.out.println(binarySearchRightMost(arr,4));
            Scanner scanner=new Scanner(System.in);
            int a=scanner.nextInt();
            int b=scanner.nextInt();
    //        int arr[]=new int[b];
            for(int j=0;j<b;j++){
                a-=scanner.nextInt();
                if(a<=0){
                    System.out.println("Yes");
                    break;
                }
            }
            if(a>0){
                System.out.println("No");
            }
    //        System.out.println(a%b==0?Math.floorDiv(a,b):Math.floorDiv(a,b)+1);
        }
    } Main static int binarySearchRightMost(int arr[],int key){
            int l=0,r=arr.length-1;
            while (l<r){
                int mid=Math.floorDiv(l+r,2);
                if(arr[mid]>key){
                    r=mid;
                }
                else{
                    l=mid+1;
                }
            }
            return r-1;
     
        } binarySearchRightMost {
            int l=0,r=arr.length-1;
            while (l<r){
                int mid=Math.floorDiv(l+r,2);
                if(arr[mid]>key){
                    r=mid;
                }
                else{
                    l=mid+1;
                }
            }
            return r-1;
     
        } int l=0 l 0 r=arr.length-1; r arr.length-1 arr.length arr arr.length 1 while (l<r){
                int mid=Math.floorDiv(l+r,2);
                if(arr[mid]>key){
                    r=mid;
                }
                else{
                    l=mid+1;
                }
            } l<r l r {
                int mid=Math.floorDiv(l+r,2);
                if(arr[mid]>key){
                    r=mid;
                }
                else{
                    l=mid+1;
                }
            } int mid=Math.floorDiv(l+r,2); mid Math.floorDiv(l+r,2) Math.floorDiv Math l+r l r 2 if(arr[mid]>key){
                    r=mid;
                }
                else{
                    l=mid+1;
                } arr[mid]>key arr[mid] arr mid key {
                    r=mid;
                } r=mid r mid {
                    l=mid+1;
                } l=mid+1 l mid+1 mid 1 return r-1; r-1 r 1 int arr[] arr int key key public static void main(String[] args) {
    //        int arr[]={1,2,3,4,4,4,6,7};
    //        System.out.println(binarySearchRightMost(arr,4));
            Scanner scanner=new Scanner(System.in);
            int a=scanner.nextInt();
            int b=scanner.nextInt();
    //        int arr[]=new int[b];
            for(int j=0;j<b;j++){
                a-=scanner.nextInt();
                if(a<=0){
                    System.out.println("Yes");
                    break;
                }
            }
            if(a>0){
                System.out.println("No");
            }
    //        System.out.println(a%b==0?Math.floorDiv(a,b):Math.floorDiv(a,b)+1);
        } main {
    //        int arr[]={1,2,3,4,4,4,6,7};
    //        System.out.println(binarySearchRightMost(arr,4));
            Scanner scanner=new Scanner(System.in);
            int a=scanner.nextInt();
            int b=scanner.nextInt();
    //        int arr[]=new int[b];
            for(int j=0;j<b;j++){
                a-=scanner.nextInt();
                if(a<=0){
                    System.out.println("Yes");
                    break;
                }
            }
            if(a>0){
                System.out.println("No");
            }
    //        System.out.println(a%b==0?Math.floorDiv(a,b):Math.floorDiv(a,b)+1);
        } Scanner scanner=new Scanner(System.in); scanner new Scanner(System.in) int a=scanner.nextInt(); a scanner.nextInt() scanner.nextInt scanner int b=scanner.nextInt(); b scanner.nextInt() scanner.nextInt scanner for(int j=0;j<b;j++){
                a-=scanner.nextInt();
                if(a<=0){
                    System.out.println("Yes");
                    break;
                }
            } int j=0; int j=0; j 0 j<b j b j++ j++ j {
                a-=scanner.nextInt();
                if(a<=0){
                    System.out.println("Yes");
                    break;
                }
            } {
                a-=scanner.nextInt();
                if(a<=0){
                    System.out.println("Yes");
                    break;
                }
            } a-=scanner.nextInt() a scanner.nextInt() scanner.nextInt scanner if(a<=0){
                    System.out.println("Yes");
                    break;
                } a<=0 a 0 {
                    System.out.println("Yes");
                    break;
                } System.out.println("Yes") System.out.println System.out System System.out "Yes" break; if(a>0){
                System.out.println("No");
            } a>0 a 0 {
                System.out.println("No");
            } System.out.println("No") System.out.println System.out System System.out "No" String[] args args public class Main {
        static int binarySearchRightMost(int arr[],int key){
            int l=0,r=arr.length-1;
            while (l<r){
                int mid=Math.floorDiv(l+r,2);
                if(arr[mid]>key){
                    r=mid;
                }
                else{
                    l=mid+1;
                }
            }
            return r-1;
     
        }
     
        public static void main(String[] args) {
    //        int arr[]={1,2,3,4,4,4,6,7};
    //        System.out.println(binarySearchRightMost(arr,4));
            Scanner scanner=new Scanner(System.in);
            int a=scanner.nextInt();
            int b=scanner.nextInt();
    //        int arr[]=new int[b];
            for(int j=0;j<b;j++){
                a-=scanner.nextInt();
                if(a<=0){
                    System.out.println("Yes");
                    break;
                }
            }
            if(a>0){
                System.out.println("No");
            }
    //        System.out.println(a%b==0?Math.floorDiv(a,b):Math.floorDiv(a,b)+1);
        }
    } public class Main {
        static int binarySearchRightMost(int arr[],int key){
            int l=0,r=arr.length-1;
            while (l<r){
                int mid=Math.floorDiv(l+r,2);
                if(arr[mid]>key){
                    r=mid;
                }
                else{
                    l=mid+1;
                }
            }
            return r-1;
     
        }
     
        public static void main(String[] args) {
    //        int arr[]={1,2,3,4,4,4,6,7};
    //        System.out.println(binarySearchRightMost(arr,4));
            Scanner scanner=new Scanner(System.in);
            int a=scanner.nextInt();
            int b=scanner.nextInt();
    //        int arr[]=new int[b];
            for(int j=0;j<b;j++){
                a-=scanner.nextInt();
                if(a<=0){
                    System.out.println("Yes");
                    break;
                }
            }
            if(a>0){
                System.out.println("No");
            }
    //        System.out.println(a%b==0?Math.floorDiv(a,b):Math.floorDiv(a,b)+1);
        }
    } Main
    import java.util.Scanner;
     
    public class Main {
        static int binarySearchRightMost(int arr[],int key){
            int l=0,r=arr.length-1;
            while (l<r){
                int mid=Math.floorDiv(l+r,2);
                if(arr[mid]>key){
                    r=mid;
                }
                else{
                    l=mid+1;
                }
            }
            return r-1;
     
        }
     
        public static void main(String[] args) {
    //        int arr[]={1,2,3,4,4,4,6,7};
    //        System.out.println(binarySearchRightMost(arr,4));
            Scanner scanner=new Scanner(System.in);
            int a=scanner.nextInt();
            int b=scanner.nextInt();
    //        int arr[]=new int[b];
            for(int j=0;j<b;j++){
                a-=scanner.nextInt();
                if(a<=0){
                    System.out.println("Yes");
                    break;
                }
            }
            if(a>0){
                System.out.println("No");
            }
    //        System.out.println(a%b==0?Math.floorDiv(a,b):Math.floorDiv(a,b)+1);
        }
    }