Problem:
 Score : 200 points    Problem Statement Raccoon is fighting with a monster.  The health of the monster is H .  Raccoon can use N kinds of special moves. Using the i -th move decreases the monster's health by A_i .
There is no other way to decrease the monster's health.  Raccoon wins when the monster's health becomes 0 or below.  If Raccoon can win without using the same move twice or more, print Yes ; otherwise, print No .      Constraints  1 \leq H \leq 10^9  1 \leq N \leq 10^5  1 \leq A_i \leq 10^4  All values in input are integers.         Input Input is given from Standard Input in the following format:  H  N  A_1  A_2  ...  A_N       Output If Raccoon can win without using the same move twice or more, print Yes ; otherwise, print No .        Sample Input 1 10 3
4 5 6      Sample Output 1 Yes  The monster's health will become 0 or below after, for example, using the second and third moves.       Sample Input 2 20 3
4 5 6      Sample Output 2 No       Sample Input 3 210 5
31 41 59 26 53      Sample Output 3 Yes       Sample Input 4 211 5
31 41 59 26 53      Sample Output 4 No

Solution (Python):

MOD = 10 ** 9 + 7

import math

import itertools



import copy


def sosuhante(n):
    for k in range(2, int(math.sqrt(n))+1):
        if n% k ==0:
            return False
    return True
def cmb(n, r):
    if n - r < r: r = n - r
    if r == 0: return 1
    if r == 1: return n

    numerator = [n - r + k + 1 for k in range(r)]
    denominator = [k + 1 for k in range(r)]

    for p in range(2,r+1):
        pivot = denominator[p - 1]
        if pivot > 1:
            offset = (n - r) % p
            for k in range(p-1,r,p):
                numerator[k - offset] /= pivot
                denominator[k] /= pivot

    result = 1
    for k in range(r):
        if numerator[k] > 1:
            result *= int(numerator[k])

    return result

def kingaku(a,b,n):
    keta=len(str(n))
    return a*n+b*keta

def my_index(l, x, default=False):
    if x in l:
        return l.index(x)
    else:
        return default



def main():
    h,n=map(int,input().split())
    a = list(map(int,input().split()))
    if sum(a)>=h:
        print("Yes")
    else:
        print("No")


if __name__ == "__main__":
    main()

Solution (Python):
h , n = map(int,input().split())
l = list(map(int,input().split()))
s = sum(l)

if s >= h:
    print('Yes')
else:
    print('No')

Solution (Python):
h,n = map(int, input().split())
a = list(map(int, input().split()))

for i in range(n):
    h -= a[i]

if h <= 0:
    print("Yes")
else:
    print("No")

Solution (Python):
H,N = map(int,input().split())
A = list(map(int,input().split()))

print('Yes') if sum(A) >= H else print('No')

Solution (Python):
H, N = map(int, input().split())
Alist = list(map(int, input().split()))

if sum(Alist) >= H:
    print("Yes")
else:
    print("No")

Solution (Python):
H,N = map(int,input().split())
A = list(map(int,input().split()))

S = sum(A)
if(H <= S): print('Yes')
else: print('No')

Solution (Python):

h, n = map(int, input().split())
a_list = list(map(int, input().split()))

if h <= sum(a_list):
    print("Yes")
else:
    print("No")

Solution (Python):
H,N = map(int,input().split())
A = [int(x) for x in input().split()]

if sum(A) >= H :
    print("Yes")
else :
    print("No")

Solution (Python):
import sys, re, os
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians

from itertools import permutations, combinations, product, accumulate
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits
from functools import reduce
from bisect import bisect_left, insort_left
from heapq import heapify, heappush, heappop

INPUT = lambda: sys.stdin.readline().rstrip()
INT = lambda: int(INPUT())
MAP = lambda: map(int, INPUT().split())
S_MAP = lambda: map(str, INPUT().split())
LIST = lambda: list(map(int, INPUT().split()))
S_LIST = lambda: list(map(str, INPUT().split()))

sys.setrecursionlimit(10 ** 9)
INF = float('inf')
mod = 10 ** 9 + 7


def main():
    H, N = MAP()
    A = LIST()

    print("Yes" if H - sum(A) <= 0 else "No")


if __name__ == '__main__':
    main()

Solution (Python):
import math
H,N = list(map(int,input().split()))
A = list(map(int,input().split()))
if sum(A) >= H:
    print("Yes")
else:
    print("No")

Solution (Python):
H,N=map(int,input().split())
A=list(map(int,input().split()))
if H-(sum(A))<=0:
    print("Yes")
else:
    print("No")

Solution (Python):
H,N = map(int, input().split())
A = [int(a) for a in input().split()]

if sum(A) >= H:
    print("Yes")
else:
    print("No")

Solution (Python):
[H, N] = [int(i) for i in input().split()]
A = [int(i) for i in input().split()]

if sum(A) >= H:
    print("Yes")
else:
    print("No")

Solution (Python):
h,n=map(int,input().split())
a=list(map(int,input().split()))
if sum(a)>=h:
  print('Yes')
else:
  print('No')

Solution (Python):
H, N = map(int, input().split())
A = [int(x) for x in input().split()]

if H <= sum(A):
    print("Yes")
else:
    print("No")

Solution (Python):
H,N = map(int,input().split(" "))
A = tuple(map(int,input().split(" ")))
dam = sum(A)
if H <= dam:
    print('Yes')
else:
    print('No')

Solution (Python):
H, N = map(int, input().split())
A = [int(i) for i in input().split()]

if sum(A) >= H:
    print('Yes')
else:
    print('No')

Solution (Python):
h, n = map(int, input().split())
a = list(map(int, input().split()))

if sum(a) >= h:
    print("Yes")
else:
    print("No")

Solution (Python):
h, n = map(int, input().split())
a = [int(i) for i in input().split()]
print('Yes' if sum(a) >= h else 'No')

Solution (Python):
inpl = lambda: list(map(int,input().split()))
H, N = inpl()
A = inpl()
if sum(A) >= H:
    print('Yes')
else:
    print('No')

Solution (Python):
h, n = map(int, input().split())
a = list(map(int, input().split()))
if sum(a) >= h:
    print("Yes")
else:
    print("No")

Solution (Python):
H, N = map(int, input().split())
A = list(map(int, input().split()))
if sum(A) >= H:
    print("Yes")
else:
    print("No")

Solution (Python):



def solve(*args: str) -> str:
    h, n = map(int, args[0].split())
    A = list(map(int, args[1].split()))

    return 'Yes' if h <= sum(A) else 'No'


if __name__ == "__main__":
    print(solve(*(open(0).read().splitlines())))

Solution (Python):
import sys
import math
import functools
stdin = sys.stdin
mod = 10**9 + 7

ns = lambda: stdin.readline().rstrip()
ni = lambda: int(ns())
na = lambda: list(map(int, stdin.readline().split()))
sa = lambda h: [list(map(int, stdin.readline().split())) for i in range(h)]


h, n = na()
a = na()

print("Yes" if sum(a) >= h else "No")

Solution (Python):
H, N = map(int, input().split())
A = list(map(int, input().split()))

if sum(A) >= H:
    print('Yes')
else:
    print('No')

Solution (Python):
h,n=map(int,input().split())
if h<=sum(list(map(int,input().split()))):print("Yes")
else:print("No")

Solution (Python):
import sys
input = sys.stdin.readline
sys.setrecursionlimit(10 ** 7)

H, N = map(int, input().split())
A = list(map(int, input().split()))


A = sorted(A, reverse=True)

if sum(A[:N]) >= H:
    print("Yes")
else:
    print("No")

Solution (Python):
h,n = map(int,input().split())
a = list(map(int,input().split()))
if h <= sum(a):
    print('Yes')
else:
    print('No')

Solution (Python):
H,N = map(int,input().split())
A = list( map(int,input().split()))

ans = H -sum(A)

if ans <= 0:
    print("Yes")
else:
    print("No")

Solution (Python):
import math

def intinput():
    return int(input())

def listintinput():
    return list(map(int,input().split()))

def splitintinput():
    return map(int,input().split())

H,N = splitintinput()
A = listintinput()

if H > sum(A):
    print('No')
else:
    print('Yes')

Solution (Python):
h, n = map(int, input().split())
A = list(map(int, input().split()))
if sum(A) >= h:
  print("Yes")
else:
  print("No")

Solution (Python):
h,n = map(int, input().split())
a = list(map(int, input().split()))

if sum(a) >= h:
  print("Yes")
else:
  print("No")

Solution (Python):
def main():
    H, N = map(int, input().split())
    A = list(map(int, input().split()))

    if sum(A) >= H:
        print('Yes')
    else:
        print('No')

if __name__ == '__main__':
    main()

Solution (Python):
H,N = map(int,input().split())
A = list(map(int,input().split()))
if sum(A)>=H:
    print("Yes")
else:
    print("No")

Solution (Python):
h, _ = map(int, raw_input().split())
aa = map(int, raw_input().split())
if h <= sum(aa):
    print 'Yes'
else:
    print 'No'

Solution (Python):

h,N=map(int,input().split())
A=list(map(int,input().split()))
S=sum(A)
if h-S>0:
    print('No')
else:
    print('Yes')

Solution (Python):
h,n = map(int,input().split())
a = list(map(int,input().split()))
if sum(a) >= h:
    print('Yes')
else:
    print('No')

Solution (Python):
A,B=map(int,input().split())
C=list(map(int,input().split()))
if sum(C)>=A:
    print("Yes")
else:
    print("No")

Solution (Python):
H,N=map(int,input().split())
A=list(map(int,input().split()))
print("Yes" if H<=sum(A) else "No")

Solution (Python):
h,n=map(int,input().split())
a=list(map(int,input().split()))
if(sum(a) >= h):
    print("Yes")
else:
    print("No")

Solution (Python):
h,n = map(int, input().split())
a = list(map(int, input().split()))

if sum(a)>=h:
    print('Yes')
else:
    print('No')

Solution (Python):


h, n = map(int, input().split())
a = list(map(int, input().split()))
suma = sum(a)
if h - suma > 0:
    print("No")
else:
    print("Yes")

Solution (Python):
a,b=list(map(int, input().split()))
l=list(map(int, input().split()))
if sum(l)>=a:
  print("Yes")
else:
  print("No")

Solution (Python):
H, N = map(int, input().split())
A = list(map(int, input().split()))
if H <= sum(A):
    print("Yes")
else:
    print("No")

Solution (Python):
import math
a,b=map(int,input().split())
c=list(map(int,input().split()))
if sum(c)>=a:
    print('Yes')
else:
    print('No')

Solution (Python):
a,b=map(int,input().split())
arr=list(map(int,input().split()))
if sum(arr)>=a:
    print("Yes")
else:
    print("No")

Solution (Python):
h,n=map(int,input().split())
A=list(map(int,input().split()))
if h<=sum(A):
    print("Yes")
else:
    print("No")

Solution (Python):

import re
import math
import fractions
import random
from heapq import heappop,heappush
import time
import sys
readline = sys.stdin.readline

mod=int(10**9+7)
inf=int(10**20)
class union_find():
    def __init__(self,n):
        self.n=n
        self.P=[a for a in range(N)]
        self.rank=[0]*n
 
    def find(self,x):
        if(x!=self.P[x]):self.P[x]=self.find(self.P[x])
        return self.P[x]
 
    def same(self,x,y):
        return self.find(x)==self.find(y)
 
    def link(self,x,y):
        if self.rank[x]<self.rank[y]:
            self.P[x]=y
        elif self.rank[y]<self.rank[x]:
            self.P[y]=x
        else:
            self.P[x]=y
            self.rank[y]+=1
 
    def unite(self,x,y):
        self.link(self.find(x),self.find(y))
 
    def size(self):
        S=set()
        for a in range(self.n):
            S.add(self.find(a))
        return len(S)
def bin_(num,size):
    A=[0]*size
    for a in range(size):
        if (num>>(size-a-1))&1==1:
            A[a]=1
        else:
            A[a]=0
    return A
def comb(n,r):return math.factorial(n)//math.factorial(n-r)//math.factorial(r)
def next_comb(num,size):
    x=num&(-num)
    y=num+x
    z=num&(~y)
    z//=x
    z=z>>1
    num=(y|z)
    if(num>=(1<<size)):return False
    else:
        return num
 

 

h,n=map(int,input().split())
A=list(map(int,input().split()))
sum_=sum(A)
if sum_<h:
    print("No")
else:
    print("Yes")

Solution (Python):
H,N=map(int,input().split())
A=list(map(int,input().split()))
S=sum(A)
if S>=H:
  print('Yes')
else:
  print('No')

Solution (Python):
h,n = map(int,input().split())
a = sum(map(int,input().split()))
if a >= h:
    print("Yes")
else:
    print("No")

Solution (Python):
H, N = map(int, input().split())
A = [int(i) for i in input().split()]

all = sum(A)

if(all >= H):
    print("Yes")
else:
    print("No")

Solution (Python):
H, N = map(int,input().split())
A = list(map(int, input().split()))
if H <= sum(A):
  print("Yes")
else:
  print("No")

Solution (Python):
H, N = map(int, input().split())
A = list(map(int, input().split()))

if H <= sum(A):
    print("Yes")
else:
    print("No")

Solution (Python):

H, N = map(int, input().split())
A = list(map(int, input().split()))
sum_A = sum(A)

if sum_A >= H:
    print("Yes")
else:
    print("No")

Solution (Python):
a, b = map(int, input().split())

u = sum(list(map(int, input().split())))

if u >= a :
  print('Yes')
else:
  print('No')

Solution (Python):
h,n=map(int,input().split())
A=list(map(int,input().split()))
print('Yes' if sum(A)>=h else 'No')

Solution (Python):
import sys


def main():
    h_and_n_s = sys.stdin.readline().strip().split(' ')
    h, n = [int(s) for s in h_and_n_s]
    a = [int(s) for s in sys.stdin.readline().strip().split(' ')]

    if sum(a) >= h:
        print('Yes')
    else:
        print('No')


if __name__ == '__main__':
    main()

Solution (Python):
h,n=map(int,input().split())
l=list(map(int,input().split()))

s=sum(l)
if s>=h:
    print("Yes")
else:
    print("No")

Solution (Python):
H, N = map(int, input().split())
As = list(map(int, input().split()))

if sum(As) >= H:
    print("Yes")
else:
    print("No")

Solution (Python):
import sys
from collections import *
import heapq
import math
import bisect
from itertools import permutations,accumulate,combinations,product
from fractions import gcd
def input():
    return sys.stdin.readline()[:-1]
mod=10**9+7

h,n=map(int,input().split())
a=list(map(int,input().split()))
if sum(a)>=h:
    print("Yes")
else:
    print("No")

Solution (Python):
H,N = [int(i) for i in input().split()]
A = [int(i) for i in input().split()]
if H > sum(A):
    print("No")
else:
    print("Yes")

Solution (Python):
h, n = map(int, input().split())
a = list(map(int, input().split()))
if sum(a) >= h:
    print('Yes')
else:
    print('No')

Solution (Python):
def inpl():
    return list(map(int, input().split()))


H, N = inpl()
A = inpl()

print("Yes" if sum(A) >= H else "No")

Solution (Python):
H, N = map(int, input().split())
Alst = list(map(int, input().split()))
if sum(Alst) >= H:
    print("Yes")
else:
    print("No")

Solution (Python):
h, n = map(int, input().split())
a = list(map(int, input().split()))

if sum(a) >= h:
    print("Yes")
else:
    print("No")

Solution (Python):
H, N = map(int,input().split())
A = list(map(int,input().split()))

if H <= sum(A):
    print("Yes")
else:
    print("No")

Solution (Python):
import sys

stdin = sys.stdin

mod = 1000000007
inf = 1 << 60

ni = lambda: int(ns())
na = lambda: list(map(int, stdin.readline().split()))
ns = lambda: stdin.readline().rstrip()
nas = lambda: stdin.readline().split()

h, n = na()
a = na()
a.sort()
a.reverse()

for i in range(n):
    h -= a[i]

if h > 0:
    print("No")
else:
    print("Yes")

Solution (Python):

from itertools import permutations, combinations
from fractions import gcd
from collections import Counter
from math import sqrt
import sys
input = sys.stdin.readline
def lcm(x, y):
    return (x*y//gcd(x, y))
def small_letters():
    return [chr(i) for i in range(97, 97+26)]
def capital_letters():
    return [chr(i) for i in range(65, 65+26)]
def continual_letters(list_x):
    """example"""
    """[2,2,2,2,4,4,5,5,5,8,8,8,8,8] => [4,2,3,5]"""
    i,j = 0,0
    result = []
    k = len(list_x) - 1
    while(True):
        A = list_x[i]
        while(True):
            print(j)
            if list_x[j] != A:
                break
            if j >= k:
                break
            j += 1
        result.append(j-i)
        if i >= k:
            break
        i = j
    result[-1] += 1
    return result


def main():
    """ここに書いてね"""
    H,N = map(int,input().split())
    hissatu = list(map(int,input().split()))
    if sum(hissatu) >= H:
        print("Yes")
    else:
        print("No")


if __name__ == '__main__':
    main()

Solution (Python):
H, N = map(int, input().split())
A = [int(i) for i in input().split()]
s = sum(A)
if s >= H:
    print('Yes')
else:
    print('No')

Solution (Python):
H, N = map(int, input().split())
AN = list(map(int, input().split()))
print("Yes" if sum(AN) >= H else "No")

Solution (Python):
h,n = map(int,input().split())
a_list = list(map(int,input().split()))

if sum(a_list) >= h:
    print('Yes')
else:
    print('No')

Solution (Python):


def main():
    H, N = map(int, input().split())
    AN = list(map(int, input().split()))
    print("Yes" if sum(AN) >= H else "No")


if __name__ == '__main__':
    main()

Solution (Python):
h, n = map(int, input().split())

a = list(map(int, input().split()))

attack = sum(a)

if h <= attack:
    print("Yes")
else:
    print("No")

Solution (Python):
h,n = map(int,input().split())
a = list(map(int,input().split()))

count = 0

for i in range(n):
  count += a[i]

if h <= count:
  print("Yes")
else:
  print("No")

Solution (Python):
h,n = map(int, input().split())
A = list(map(int, input().split()))
print('Yes' if sum(A)>=h else 'No')

Solution (Python):
H, N = map(int, input().split())
A = list(map(int, input().split()))
if H <= sum(A):
    print('Yes')
else:
    print('No')

Solution (Python):
H, N = map(int, input().split())
A = list(map(int, input().split()))
if sum(A) >= H:
    print("Yes")
else:
    print("No")

Solution (Python):
h, n = map(int, input().split())
A = list(map(int, input().split()))

if sum(A) >= h:
    print('Yes')
else:
    print('No')

Solution (Python):
h, n = map(int, input().split())
a = list(map(int, input().split()))

if sum(a) >= h:
    print('Yes')
else:
    print('No')

Solution (Python):

H,N= map(int,input().split())
A =list(map(int,input().split()))


if sum(A) >= H:
    print('Yes')
else:
    print('No')

Solution (Python):
h,n=map(int,input().split())
A=list(map(int,input().split()))
if sum(A) >= h:
    print("Yes")
else:
    print("No")

Solution (Python):
[H,N] = list(map(int,input().split()))
A = list(map(int,input().split()))
S = sum(A)

if S>=H:
    print("Yes")
else:
    print("No")

Solution (Python):

h, n = map(int, input().split())
a_ls = list(map(int, input().split()))
sum_at = 0
for i in range(len(a_ls)):
    sum_at+=a_ls[i]
if h > sum_at:
    print("No")
else:
    print("Yes")

Solution (Python):
import math
H, N = map(int, input().split())
A = list(map(int, input().split()))

if sum(A) < H:
	print("No")
else:
	print("Yes")

Solution (Python):
h, n = map(int, input().split())
a = list(map(int, input().split()))
if sum(a) >= h:
    print("Yes")
else:
    print("No")

Solution (Python):
import sys
input = sys.stdin.readline
H, N = [int(x) for x in input().split()]
A = [int(x) for x in input().split()]
if sum(A) >= H:
    print("Yes")
else:
    print("No")

Solution (Python):


import sys

def input(): return sys.stdin.readline().strip()
def list2d(a, b, c): return [[c] * b for i in range(a)]
def list3d(a, b, c, d): return [[[d] * c for j in range(b)] for i in range(a)]
def list4d(a, b, c, d, e): return [[[[e] * d for j in range(c)] for j in range(b)] for i in range(a)]
def ceil(x, y=1): return int(-(-x // y))
def INT(): return int(input())
def MAP(): return map(int, input().split())
def LIST(N=None): return list(MAP()) if N is None else [INT() for i in range(N)]
def Yes(): print('Yes')
def No(): print('No')
def YES(): print('YES')
def NO(): print('NO')
sys.setrecursionlimit(10 ** 9)
INF = 10 ** 18
MOD = 10 ** 9 + 7

H, N = MAP()
A = LIST()

if sum(A) >= H:
    Yes()
else:
    No()

Solution (Python):
def main():
    from sys import stdin, setrecursionlimit
    
    
    r = stdin.readline()[:-1]
    
    
    
    
    
    
    h,n = map(int, r.split())
    r = stdin.readline()[:-1]
    a = list(map(int, r.split()))
    
    
    

    if h > sum(a):
        print('No')
    else:
        print('Yes')
    

if __name__ == '__main__':
    main()

Solution (Python):
H, N=map(int, input().split())
A=list(map(int, input().split()))
if sum(A)>=H:
  print('Yes')
else:
  print('No')

Solution (Python):
H, A = map(int, input().split())
A = list(map(int, input().split()))
tmp = sum(A)
if H <= tmp:
    print("Yes")
else:
    print("No")

Solution (Python):
H, N = map(int, input().split())
* A, = map(int, input().split())
if sum(A) >= H:
    print("Yes")
else:
    print("No")

Solution (Python):
H, N = map(int, input().split())
A = list(map(int, input().split()))

if sum(A) >= H:
  print('Yes')
else:
  print('No')

Solution (Python):
H, N = [int(s) for s in input().split()]
A = [int(s) for s in input().split()]
s = 0
for a in A:
    s += a
if s >= H:
    print("Yes")
else:
    print("No")

Solution (Python):
import sys
sys.setrecursionlimit(4100000)

import math

import logging

logging.basicConfig(level=logging.DEBUG)

logger = logging.getLogger(__name__)


def resolve():
    
    
    H, N = [int(x) for x in sys.stdin.readline().split()]  
    a_list = [int(x) for x in sys.stdin.readline().split()]  

    

    
    
    

    logger.debug('{}'.format([]))

    s = sum(a_list)

    if s >= H:
        print('Yes')
    else:
        print('No')


if __name__ == "__main__":
    resolve()





import sys
from io import StringIO
import unittest


class TestClass(unittest.TestCase):
    def assertIO(self, input, output):
        stdout, stdin = sys.stdout, sys.stdin
        sys.stdout, sys.stdin = StringIO(), StringIO(input)
        resolve()
        sys.stdout.seek(0)
        out = sys.stdout.read()[:-1]
        sys.stdout, sys.stdin = stdout, stdin
        self.assertEqual(out, output)

    def test_入力例_1(self):
        input = """10 3
4 5 6"""
        output = """Yes"""
        self.assertIO(input, output)

    def test_入力例_2(self):
        input = """20 3
4 5 6"""
        output = """No"""
        self.assertIO(input, output)

    def test_入力例_3(self):
        input = """210 5
31 41 59 26 53"""
        output = """Yes"""
        self.assertIO(input, output)

    def test_入力例_4(self):
        input = """211 5
31 41 59 26 53"""
        output = """No"""
        self.assertIO(input, output)

Solution (Python):
h, n = map(int ,input().split())
a = sum(map(int,input().split()))

if h > a:print("No")
else: print("Yes")

Solution (Python):


H, N = map(int, input().split())
A = list(map(int, input().split()))

A.sort(reverse=True)
for i in range(N):
    H -= A[i]

print('Yes' if H <= 0 else 'No')

Solution (Python):
H, N = map(int, input().split())
A = list(map(int, input().split()))
if H <= sum(A):
    print('Yes')
else:
    print('No')

Solution (Python):

H, N = map(int, input().split())
A = list(map(int, input().split()))
if sum(A) >= H:
    print('Yes')
else:
    print('No')

Solution (Python):
h, n = (int(i) for i in input().split())
a = [int(i) for i in input().split()]
if h > sum(a):
    print('No')
else:
    print('Yes')

Solution (Python):
H,N = map(int,input().split())
A = list(map(int,input().split()))
if sum(A) >= H:
    print("Yes")
else:
    print("No")

Solution (Python):
H, N = map(int, input().split())
A = list(map(int, input().split()))
if H <= sum(A):
    print('Yes')
else:
    print('No')

Solution (Python):
h,n=map(int,input().split())
a=list(map(int,input().split()))
if sum(a)>=h:
    print('Yes')
else:
    print('No')

Solution (Python):
H, N = map(int,input().split())
A = map(int,input().split())
if sum(A) >= H:
    print('Yes')
else:
    print('No')

Solution (Python):
import os,sys
from io import BytesIO, IOBase

def ii(): return int(input())
def si(): return input()
def mi(): return map(int,input().split())
def li(): return list(mi())

mod=1000000007

import math  

for i in range(1):
    h,n=mi()
    a=li()
    if sum(a)>=h:
        print("Yes")
    else:
        print("No")

Solution (Python):
H, N = map(int, input().split())
A = list(map(int, input().split()))

print('Yes' if sum(A) >= H else 'No')

Solution (Python):
H,N = map(int,input().split())
A = list(map(int,input().split()))
if sum(A)>=H:
  print('Yes')
else:
  print('No')

Solution (Python):
H, N = map(int, input().split())
*A, = map(int, input().split())
if sum(A) >= H:
    print("Yes")
else:
    print("No")

Solution (Python):

h, n = map(int, input().split())
a = list(map(int, input().split()))

if h <= sum(a):
    print('Yes')
else:
    print('No')

Solution (Python):
H, N = map(int, input().split())
A = list(map(int, input().split()))

if H > sum(A):
    print("No")
else:
    print("Yes")

Solution (Python):
H, N = map(int, input().split())
A = sorted(map(int, input().split()), reverse=True)

for a in A:
    H -= a

if H > 0:
    print('No')
else:
    print('Yes')

Solution (Python):
import sys
from collections import defaultdict
from collections import deque
import numpy as np
import heapq
from heapq import heappush, heappop

sys.setrecursionlimit(10 ** 7)


H, N = map(int, input().split())
A = list(map(int, input().split()))

a = sum(A)

if a >= H:
    print('Yes')
else:
    print('No')

Solution (Python):
a = [int(x) for x in input().split()]
b = [int(x) for x in input().split()]
summ=0
for i in b:
    summ+=i
if(summ>=a[0]): print("Yes")
else: print("No")

Solution (Python):

import sys
input = sys.stdin.readline

h, n = [int(item) for item in input().split()]
a = [int(item) for item in input().split()]
attack_sum = sum(a)
if attack_sum >= h:
    print("Yes")
else:
    print("No")

Solution (Python):
h,n=[int(x) for x in input().split()]
a=[int(x) for x in input().split()]
if sum(a)>=h:
    print("Yes")
else:
    print("No")

Solution (Python):
import math
H,N = map(int, input().split())
A = list(map(int, input().split()))

if sum(A) >= H:
  print("Yes")
else:
  print("No")

Solution (Python):
x,y = map(int,input().split()) 
li = list(map(int,input().split()))
if x<=sum(li):
    print("Yes")
else :
    print("No")

Solution (Python):
H,A=map(int,input().split())
A=list(map(int,input().split() ))

B=sum(A)

if B>=H:
  print("Yes")
else:
  print("No")

Solution (Python):
h,n=map(int,input().split())

a=list(map(int,input().split()))


s=sum(a)


ans="Yes" if s>=h else "No"
print(ans)

Solution (Python):
h, n = map(int, input().split())
A = list(map(int, input().split()))

if sum(A) >= h:
    ans = 'Yes'
else:
    ans = 'No'

print(ans)

Solution (Python):
H, N = map(int, input().split())
A = list(map(int, input().split()))

if sum(A)>=H:
    print('Yes')
else:
    print('No')

Solution (Python):
n, m = list(map(int, input().split()))
a = list(map(int, input().split()))
if sum(a) >= n:
  print("Yes")
else: print("No")

Solution (Python):
def two_int():
    N, K = map(int, input().split())
    return N,K

def one_int():
    return int(input())

def one_str():
    return input()

def many_int():
    return list(map(int, input().split()))

H,N = two_int()
A=many_int()

sumA=sum(A)

if sumA >= H:
    print("Yes")
else:
    print("No")

Solution (Python):
H, N = map(int, input().split())
A = list(map(int, input().split()))

print('Yes' if sum(A) >= H else 'No')

Solution (Python):
H, N = map(int, input().split())
As = list(map(int, input().split()))

sumA = sum(As)

if sumA >= H:
    print('Yes')
else:
    print('No')

Solution (Python):
from heapq import heappush, heappop, heapify
from collections import deque, defaultdict, Counter
import itertools
from itertools import permutations, combinations, accumulate
import sys
import bisect
import string
import math
import time


def I(): return int(input())


def MI(): return map(int, input().split())


def S(): return input()


def MS(): return map(str, input().split())


def LI(): return [int(i) for i in input().split()]


def LI_(): return [int(i)-1 for i in input().split()]


def StoI(): return [ord(i)-97 for i in input()]


def ItoS(nn): return chr(nn+97)


def input(): return sys.stdin.readline().rstrip()


def show(*inp, end='\n'):
    if show_flg:
        print(*inp, end=end)


YN = {False: 'No', True: 'Yes'}
MOD = 10**9+7
inf = float('inf')
IINF = 10**10
l_alp = string.ascii_lowercase
u_alp = string.ascii_uppercase
ts = time.time()
sys.setrecursionlimit(10**6)
nums = ['1', '2', '3', '4', '5', '6', '7', '8', '9', '10']

show_flg = False



def main():
    H, N = MI()
    A = LI()

    for i in range(N):
        H -= A[i]

    print(YN[H <= 0])


if __name__ == '__main__':
    main()

Solution (Python):
from math import ceil

def main():
    H,N = map(int,input().split())
    A = list(map(int,input().split()))
    if sum(A) >= H:
        print("Yes")
    else:
        print("No")



if __name__ == "__main__":
    main()

Solution (Python):
H, N = map(int, input().split())
A = list(map(int, input().split()))

if H > sum(A):
  print("No")
else:
  print("Yes")

Solution (Python):
H,N = map(int,input().split())
*A, = map(int,input().split())
S = sum(A)
print("Yes" if S>=H else "No")

Solution (Python):
H, N = map(int, input().split())
A = list(map(int, input().split()))

if sum(A) >= H:
  print("Yes")
else:
  print("No")

Solution (Python):
H,N=map(int,input().split())
A=list(map(int,input().split()))

if sum(A)>=H:
    print('Yes')
else:
    print('No')

Solution (Python):
h,n=map(int,input().split())
lists=list(map(int,input().split()))
if h>sum(lists):
    print("No")
else:
    print("Yes")

Solution (Python):
h,n = map(int,input().split())
a = sum(list(map(int,input().split())))

print('Yes' if a >= h else 'No')

Solution (Python):
H, N = list(map(int, input().split()))
S = sum(list(map(int, input().split())))
print('Yes' if S>=H else 'No')

Solution (Python):
H, N = map(int, input().split())
A = list(map(int, input().split()))
print('Yes' if H - sum(A) <= 0 else 'No')

Solution (Python):
h, a = map(int, input().split())
a = list(map(int, input().split()))
total = sum(a)
if total >= h:
    print('Yes')
else:
    print('No')

Solution (Python):
h,n = map(int,input().split())
a = list(map(int,input().split()))
if h > sum(a):
    print("No")
else:
    print("Yes")

Solution (Python):

import sys
input = sys.stdin.buffer.readline


from collections import defaultdict

con = 10 ** 9 + 7

def getlist():
	return list(map(int, input().split()))


def main():
	H, N = getlist()
	A = getlist()
	if sum(A) >= H:
		print("Yes")
	else:
		print("No")
	


if __name__ == '__main__':
	main()

Solution (Python):

H,N=map(int,input().split())
A=list(map(int,input().split()))

if H<=sum(A):
    print("Yes")
else:
    print("No")

Solution (Python):
H, N = map(int, input().split())
A = [int(i) for i in input().split()]

if sum(A) >= H:
    print('Yes')
else:
    print('No')

Solution (Python):
h, n = map(int, input().split())
a = list(map(int, input().split()))

if h <= sum(a) :
    print('Yes')
else :
    print('No')

Solution (Python):
h,n = map(int,input().split())
a = list(map(int,input().split()))
if sum(a) >= h:
    print("Yes")
else:
    print("No")

Solution (Python):
h,n=map(int,input().split())

a=list(map(int,input().split()))

print('Yes') if h<=sum(a) else print('No')

Solution (Python):
h, n = map(int, input().split())
a = list(map(int, input().split()))

s = sum(a)

if h <= s:
    print("Yes")
else:
    print("No")

Solution (Python):


iim = lambda: map(int, input().rstrip().split())

def resolve():
    H, N = iim()
    A = sum(iim())

    print("Yes" if A >= H else "No")



if __name__ == "__main__":
    resolve()

Solution (Python):
import sys
import math
from collections import deque
input = sys.stdin.readline
H, N = map(int,input( ).split())
A = list(map(int,input().split()))
if H <= sum(A):
    print("Yes")
else:
    print("No")

Solution (Python):
H, N = map(int, input().split())
A = [int(i) for i in input().split()]

if sum(A)>= H:
    print("Yes")
else:
    print("No")

Solution (Python):
import copy
a,b=map(int,input().split())
c=list(map(int, input().split()))
if a>sum(c):
    print("No")
else:
    print("Yes")