import java.io.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.Scanner;
import java.util.Collections;

/**
 * Built using CHelper plug-in
 * Actual solution is at the top
 */
public class Main {
    public static void main(String[] args) {
        InputStream inputStream = System.in;
        OutputStream outputStream = System.out;
        Scanner in = new Scanner(inputStream);
        PrintWriter out = new PrintWriter(outputStream);
        B solver = new B();
        solver.solve(1, in, out);
        out.close();
    }

    static class B {
        public void solve(int testNumber, Scanner in, PrintWriter out) {
            // 入力
            int H = Integer.parseInt(in.next());//体力
            int N = Integer.parseInt(in.next());//種類
            Integer[] A = new Integer[N];//必殺
            for (int i = 0; i < N; i++) {
                A[i] = Integer.valueOf(in.next());
            }
            Arrays.sort(A, Collections.reverseOrder());

            for (int i = 0; i < N; i++) {
                H -= A[i];
                if (H <= 0) {
                    out.println("Yes");
                    return;
                }
            }
            out.println("No");

        }

    }
}
 import java.io.OutputStream; OutputStream java.io import java.io.IOException; IOException java.io import java.io.InputStream; InputStream java.io import java.io.PrintWriter; PrintWriter java.io import java.util.Arrays; Arrays java.util import java.util.Scanner; Scanner java.util import java.util.Collections; Collections java.util public class Main {
    public static void main(String[] args) {
        InputStream inputStream = System.in;
        OutputStream outputStream = System.out;
        Scanner in = new Scanner(inputStream);
        PrintWriter out = new PrintWriter(outputStream);
        B solver = new B();
        solver.solve(1, in, out);
        out.close();
    }

    static class B {
        public void solve(int testNumber, Scanner in, PrintWriter out) {
            // 入力
            int H = Integer.parseInt(in.next());//体力
            int N = Integer.parseInt(in.next());//種類
            Integer[] A = new Integer[N];//必殺
            for (int i = 0; i < N; i++) {
                A[i] = Integer.valueOf(in.next());
            }
            Arrays.sort(A, Collections.reverseOrder());

            for (int i = 0; i < N; i++) {
                H -= A[i];
                if (H <= 0) {
                    out.println("Yes");
                    return;
                }
            }
            out.println("No");

        }

    }
} Main public static void main(String[] args) {
        InputStream inputStream = System.in;
        OutputStream outputStream = System.out;
        Scanner in = new Scanner(inputStream);
        PrintWriter out = new PrintWriter(outputStream);
        B solver = new B();
        solver.solve(1, in, out);
        out.close();
    } main {
        InputStream inputStream = System.in;
        OutputStream outputStream = System.out;
        Scanner in = new Scanner(inputStream);
        PrintWriter out = new PrintWriter(outputStream);
        B solver = new B();
        solver.solve(1, in, out);
        out.close();
    } InputStream inputStream = System.in; inputStream System.in System System.in OutputStream outputStream = System.out; outputStream System.out System System.out Scanner in = new Scanner(inputStream); in new Scanner(inputStream) PrintWriter out = new PrintWriter(outputStream); out new PrintWriter(outputStream) B solver = new B(); solver new B() solver.solve(1, in, out) solver.solve solver 1 in out out.close() out.close out String[] args args static class B {
        public void solve(int testNumber, Scanner in, PrintWriter out) {
            // 入力
            int H = Integer.parseInt(in.next());//体力
            int N = Integer.parseInt(in.next());//種類
            Integer[] A = new Integer[N];//必殺
            for (int i = 0; i < N; i++) {
                A[i] = Integer.valueOf(in.next());
            }
            Arrays.sort(A, Collections.reverseOrder());

            for (int i = 0; i < N; i++) {
                H -= A[i];
                if (H <= 0) {
                    out.println("Yes");
                    return;
                }
            }
            out.println("No");

        }

    } B public void solve(int testNumber, Scanner in, PrintWriter out) {
            // 入力
            int H = Integer.parseInt(in.next());//体力
            int N = Integer.parseInt(in.next());//種類
            Integer[] A = new Integer[N];//必殺
            for (int i = 0; i < N; i++) {
                A[i] = Integer.valueOf(in.next());
            }
            Arrays.sort(A, Collections.reverseOrder());

            for (int i = 0; i < N; i++) {
                H -= A[i];
                if (H <= 0) {
                    out.println("Yes");
                    return;
                }
            }
            out.println("No");

        } solve {
            // 入力
            int H = Integer.parseInt(in.next());//体力
            int N = Integer.parseInt(in.next());//種類
            Integer[] A = new Integer[N];//必殺
            for (int i = 0; i < N; i++) {
                A[i] = Integer.valueOf(in.next());
            }
            Arrays.sort(A, Collections.reverseOrder());

            for (int i = 0; i < N; i++) {
                H -= A[i];
                if (H <= 0) {
                    out.println("Yes");
                    return;
                }
            }
            out.println("No");

        } int H = Integer.parseInt(in.next()); H Integer.parseInt(in.next()) Integer.parseInt Integer in.next() in.next in int N = Integer.parseInt(in.next()); N Integer.parseInt(in.next()) Integer.parseInt Integer in.next() in.next in Integer[] A = new Integer[N]; A new Integer[N] N for (int i = 0; i < N; i++) {
                A[i] = Integer.valueOf(in.next());
            } int i = 0; int i = 0; i 0 i < N i N i++ i++ i {
                A[i] = Integer.valueOf(in.next());
            } {
                A[i] = Integer.valueOf(in.next());
            } A[i] = Integer.valueOf(in.next()) A[i] A i Integer.valueOf(in.next()) Integer.valueOf Integer in.next() in.next in Arrays.sort(A, Collections.reverseOrder()) Arrays.sort Arrays A Collections.reverseOrder() Collections.reverseOrder Collections for (int i = 0; i < N; i++) {
                H -= A[i];
                if (H <= 0) {
                    out.println("Yes");
                    return;
                }
            } int i = 0; int i = 0; i 0 i < N i N i++ i++ i {
                H -= A[i];
                if (H <= 0) {
                    out.println("Yes");
                    return;
                }
            } {
                H -= A[i];
                if (H <= 0) {
                    out.println("Yes");
                    return;
                }
            } H -= A[i] H A[i] A i if (H <= 0) {
                    out.println("Yes");
                    return;
                } H <= 0 H 0 {
                    out.println("Yes");
                    return;
                } out.println("Yes") out.println out "Yes" return; out.println("No") out.println out "No" int testNumber testNumber Scanner in in PrintWriter out out public class Main {
    public static void main(String[] args) {
        InputStream inputStream = System.in;
        OutputStream outputStream = System.out;
        Scanner in = new Scanner(inputStream);
        PrintWriter out = new PrintWriter(outputStream);
        B solver = new B();
        solver.solve(1, in, out);
        out.close();
    }

    static class B {
        public void solve(int testNumber, Scanner in, PrintWriter out) {
            // 入力
            int H = Integer.parseInt(in.next());//体力
            int N = Integer.parseInt(in.next());//種類
            Integer[] A = new Integer[N];//必殺
            for (int i = 0; i < N; i++) {
                A[i] = Integer.valueOf(in.next());
            }
            Arrays.sort(A, Collections.reverseOrder());

            for (int i = 0; i < N; i++) {
                H -= A[i];
                if (H <= 0) {
                    out.println("Yes");
                    return;
                }
            }
            out.println("No");

        }

    }
} public class Main {
    public static void main(String[] args) {
        InputStream inputStream = System.in;
        OutputStream outputStream = System.out;
        Scanner in = new Scanner(inputStream);
        PrintWriter out = new PrintWriter(outputStream);
        B solver = new B();
        solver.solve(1, in, out);
        out.close();
    }

    static class B {
        public void solve(int testNumber, Scanner in, PrintWriter out) {
            // 入力
            int H = Integer.parseInt(in.next());//体力
            int N = Integer.parseInt(in.next());//種類
            Integer[] A = new Integer[N];//必殺
            for (int i = 0; i < N; i++) {
                A[i] = Integer.valueOf(in.next());
            }
            Arrays.sort(A, Collections.reverseOrder());

            for (int i = 0; i < N; i++) {
                H -= A[i];
                if (H <= 0) {
                    out.println("Yes");
                    return;
                }
            }
            out.println("No");

        }

    }
} Main
import java.io.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.Scanner;
import java.util.Collections;

/**
 * Built using CHelper plug-in
 * Actual solution is at the top
 */
public class Main {
    public static void main(String[] args) {
        InputStream inputStream = System.in;
        OutputStream outputStream = System.out;
        Scanner in = new Scanner(inputStream);
        PrintWriter out = new PrintWriter(outputStream);
        B solver = new B();
        solver.solve(1, in, out);
        out.close();
    }

    static class B {
        public void solve(int testNumber, Scanner in, PrintWriter out) {
            // 入力
            int H = Integer.parseInt(in.next());//体力
            int N = Integer.parseInt(in.next());//種類
            Integer[] A = new Integer[N];//必殺
            for (int i = 0; i < N; i++) {
                A[i] = Integer.valueOf(in.next());
            }
            Arrays.sort(A, Collections.reverseOrder());

            for (int i = 0; i < N; i++) {
                H -= A[i];
                if (H <= 0) {
                    out.println("Yes");
                    return;
                }
            }
            out.println("No");

        }

    }
}

