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):
h,n = map(int,input().split())
a = list(map(int,input().split()))
s = 0
for i in range(n):
    s += a[i]
if s >= h:
    print('Yes')
else:
    print('No')

Solution (Python):
H, N = map(int, input().split())
A = list(map(int, input().split()))
A.sort()
A = A[:N]
s = sum(A)
ans = 'No'
if s >= H:
  ans = 'Yes'
print(ans)

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

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())
print("Yes" if h <= sum(map(int, input().split())) else "No")

Solution (Python):
h,n = map(int,input().split())
L = list(map(int,input().split()))
L.sort(reverse = True)
cnt = 0
for i in range(n):
    cnt  += L[i]
    if cnt >= h:
        print("Yes")
        exit()
print("No")

Solution (Python):
import sys

sys.setrecursionlimit(10 ** 7)
input = sys.stdin.readline
f_inf = float('inf')
mod = 10 ** 9 + 7


def resolve():
    h, n = map(int, input().split())
    A = list(map(int, input().split()))

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


if __name__ == '__main__':
    resolve()

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):



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


a_sum = sum(a_nums)


if a_sum>=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):
import math
import string
import collections
from collections import Counter
from collections import deque
from decimal import Decimal
import sys
import fractions


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


def nCr(n, r):
    return math.factorial(n)//(math.factorial(n-r)*math.factorial(r))


def has_duplicates2(seq):
    seen = []
    for item in seq:
        if not(item in seen):
            seen.append(item)
    return len(seq) != len(seen)


def divisor(n):
    divisor = []
    for i in range(1, n+1):
        if n % i == 0:
            divisor.append(i)
    return divisor



dx = [-1, -1, -1, 0, 0, 1, 1, 1]
dy = [-1, 0, 1, -1, 1, -1, 0, 1]
h, n = map(int, input().split())

a = readints()
sum_x = 0
for i in range(n):
    sum_x += a[i]
if sum_x >= h:
    print('Yes')
else:
    print('No')

Solution (Python):
H,N = map(int,input().split())
A = list(map(int,input().split()))
tot = sum(A)
if tot>=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):
import sys
input = sys.stdin.readline
from collections import *

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 =list(map(int, input().split()))
if sum(A) >= h:
    print('Yes')
else:
    print('No')

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

Solution (Python):
a,b = [int(x) for x in input().split()]
arr = [int(x) for x in 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)>0:
    print("No")
else:
    print("Yes")

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

print("Yes" if sum(A_list) >= H else "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(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 sum(a) >= h else print('No')

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

for i in range(n):
    h = h - a[i]
    if h <= 0:
        print('Yes')
        exit(0)

print('No')

Solution (Python):
H, N = map(int, input().split())
A = [int(i) for i in 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):
n,m = map(int,input().split())
li=list(map(int,input().split()))
if n>sum(li):
    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("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('Yes')
else:
    print('No')

Solution (Python):
import math

H, N = map(int, input().split())
A = list(map(int, input().split()))
ans = sum(A)
if ans >= 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()))
for i in range(n):
  h-= A[i]
if h>0:
  print("No")
else:
  print("Yes")

Solution (Python):
h,a = [int(i) for i in input().split()]

m = [int(i) for i in input().split()]

ans='No'

if h<=sum(m): ans='Yes'

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):
def main():
    h, n = map(int, input().split())
    inlis = list(map(int, input().split()))

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


    
if __name__ == "__main__":
    main()

Solution (Python):
mod = 1e9+7
def add(a, b):
    c = a + b
    if c >= mod:
        c -= mod
    return c

def main():
    H, N = [int(x) for x in raw_input().split()]
    
    s = sum([int(x) for x in raw_input().split()])
    
    if s >= H:
        print('Yes')
    else:
        print('No')
    
    

main()

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

Solution (Python):
import sys
input = sys.stdin.readline

h,n = map(int,input().split())
L=list(map(int,input().split()))
for i in range(n):
    h-=L[i]
    if h<=0:
        print('Yes')
        break
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 = list(map(int, input().split()))

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

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

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

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

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

Solution (Python):
H,N=map(int,input().split())
A=list(map(int,input().split()))
total=sum(A)
if (H-total)<=0:
  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 h - sum(a) <= 0:
    print("Yes")
else:
    print("No")

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

Solution (Python):
A = [list(map(int, input().split())) for _ in range(2)]

if sum(A[1]) >= A[0][0]:
  print("Yes")
else:
  print("No")

Solution (Python):
h,a = map(int,input().split())
l=list(map(int,input().split()))
sum=0
i=0
while h>=sum and i<a:
  sum+=l[i]
  i+=1
if sum>=h:
  print('Yes')
else:
  print('No')

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

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

Solution (Python):
import sys
input = lambda: sys.stdin.readline().rstrip()

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

if __name__ == '__main__':
    main()

Solution (Python):
def actual(h, n, A):
    max_damage = sum(A)

    if max_damage >= h:
        return 'Yes'

    return 'No'

h, n = map(int, input().split())
A = map(int, input().split())

print(actual(h, n, A))

Solution (Python):
h,n=map(int,input().split())
a=input().split()
num=0
l=[]
for i in a:
  l.append(int(i))

for i in l:
  num = i + num
  
if num >= h:
  print('Yes')
else:
  print('No')

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

if sum(a) >= n:
  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):
import sys

input = lambda: sys.stdin.readline().rstrip()


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


if __name__ == '__main__':
    solve()

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, *a = map(int, open(0).read().split())
if sum(a) >= n:
    print('Yes')
else:
    print('No')

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

    damage = 0

    for i in range(N):
        damage += A[i]
        if damage >= H:
            print("Yes")
            exit(0)

    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 = 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()))
s=sum(a)

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

Solution (Python):

import sys
import heapq

YES = "Yes"  
NO = "No"  


def solve(H: int, N: int, A: "List[int]"):
    damage = sum(A)
    if H > damage:
        print(NO)
    else:
        print(YES)
    return



def main():
    def iterate_tokens():
        for line in sys.stdin:
            for word in line.split():
                yield word
    tokens = iterate_tokens()
    H = int(next(tokens))  
    N = int(next(tokens))  
    A = [int(next(tokens)) for _ in range(N)]  
    solve(H, N, A)

if __name__ == '__main__':
    main()

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
input = sys.stdin.readline

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):
    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
import decimal 

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

def main():
    h, n = map(int, input().split())
    a = list(map(int, input().split()))    
    for i in a:
        h -= i
        if h <= 0:
            print("Yes")
            return
    print("No")
    

main()

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()))
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):
from functools import reduce
from fractions import gcd
import math
import bisect
import itertools
import sys
sys.setrecursionlimit(10**7)
input = sys.stdin.readline
INF = float("inf")



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())
if h > sum(list(map(int, input().split()))):
    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()))
sum_a = sum(a)

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

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

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

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

Solution (Python):
H, N = (int(x) for x in 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('No')
else:
    print('Yes')

Solution (Python):
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):
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())
PP = list(map(int, input().split()))
print("Yes" if sum(PP) >= H else "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 = list(map(int, input().split()))
if sum(a) < h:
    print("No")
else:
    print("Yes")

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

Solution (Python):
H, N = map(int, input().split())
A    = list(map(int, input().split()))
for n in range(N):
    H = H - A[n]
if H <= 0:
    print('Yes')
else:
    print('No')

Solution (Python):
H, N = map(int, input().split())
A = list(map(int, input().split()))
cnt = 0
while (H > 0):
    for n in range(N):
        H = H - A[n]
    cnt += 1
if cnt == 1:
    print('Yes')
else:
    print('No')

Solution (Python):
H,N = list(map(int,input().split(" ")))
A = list(map(int,input().split(" ")))
total = 0
for i in A:
  total += i
if total >= 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 'No')

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()))

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 = list(map(int, input().split()))
a = sorted(list(map(int, input().split())), reverse=True)
print('Yes' if sum(a[:n])>=h else '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):
import sys
from collections import defaultdict
readline = sys.stdin.buffer.readline


def geta(fn=lambda s: s.decode()):
    return map(fn, readline().split())


def gete(fn=lambda s: s.decode()):
    return fn(readline().rstrip())





def main():
    h, n = geta(int)

    if h <= sum(list(geta(int))):
        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('No')
else:
    print('Yes')

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()))

print("{}".format("Yes" if sum(A) >= H else "No"))

Solution (Python):

import sys

read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines


def main():
    H, N = map(int, readline().split())
    As = map(int, readline().split())
    if sum(As) >= 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,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 H<=sum(A):
        print("Yes")
    else:
        print("No")

main()

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

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, n = [int(x) for x in input().split()]
a = [int(x) for x in input().split()]
print('Yes' if sum(a) >= h else 'No')

Solution (Python):

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

attack = sum(sorted(a, reverse=True)[:n])

if attack < 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):
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())

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

for i in list_n:
    H -= i
    if H <= 0:
        print("Yes")
        break

if H > 0:
    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):
x = list(map(int, input().split()))
a = list(map(int, input().split()))
hp = x[0]
for i in a:
  hp -= i
if hp <= 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())
A=list(map(int,input().split()))
print("Yes" if sum(A)>=H else "No")

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

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

Solution (Python):

def main():
    H,N  = map(int, input().split()) 
    A = list(map(int, input().split())) 
    if H<=sum(A):
        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 = list(map(int, input().split()))

A.sort()
for i in range(len(A)):
  if H > 0:
    H -= A[len(A)-1-i]
  else:
    print("Yes")
    exit()
if H > 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):
H,N = map(int,input().split())
A = list(map(int,input().split()))
S = 0
for i in range(N):
  S += A[i]
if H > S:
  print('No')
else:
  print('Yes')

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

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

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_list = list(map(int, input().split()))

d = 0
for a in a_list:
    d += a

if d < h:
    print("No")
else:
    print("Yes")

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 = list(map(int, input().split()))
t = 0
for a in a_list:
    t += a
if t >= 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):
n,m=map(int,input().split())
l=list(map(int,input().split()))
d=sum(l)
if n>d:
    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

def ILI(): return list(map(int, sys.stdin.readline().rstrip().split()))
def ISI(): return map(int, sys.stdin.readline().rstrip().split())

h, n = ISI()
A = ILI()
if sum(A)<h:print("No")
else:print("Yes")

Solution (Python):
h,n=map(int,input().split())
a=list(map(int,input().split()))
result=0
for i in range(len(a)):
    result+=a[i]
if h<=result:
    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("No")
else:
  print("Yes")

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):
def resolve():
    h,n=map(int,input().split())
    a=list(map(int,input().split()))
    a.sort(reverse=True)
    if sum(a[:n])>=h:
        print("Yes")
    else:
        print("No")
resolve()

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, raw_input().split(' '))
moves = map(int, raw_input().split(' '))
if sum(moves) >= h:
	print 'Yes'
else:
	print 'No'

Solution (Python):
h,n=(int(x) for x in input().split())

a=[]

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

at_sum=0
for i in range(n):
	at_sum+=a[i]
	if h<=at_sum:
		print("Yes")
		break

if h>at_sum:
	print("No")

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

acc = 0
for a in A:
    acc += a

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

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

Solution (Python):
h,n=map(int,input().split())
a=map(int,input().split())
s=0
for i in a:
    s+=i
if s>=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 = 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()))
ans = 'No'

for i in A:
    H -= i
    if H <= 0:
        ans = 'Yes'
        break

print(ans)

Solution (Python):
a=input().split(' ')
b=input().split(' ')
a[0]=int(a[0])
a[1]=int(a[1])
m=0
while m<a[1]:
    b[m]=int(b[m])
    a[0]=a[0]-b[m]
    if a[0]<=0:
        m=m+a[1]
        print('Yes')
    m=m+1
if a[0]>0:
    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 sum(A)>=H else "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_list = list(map(int, input().split()))

sorted_A_list = sorted(A_list)
attack_A_list = sorted_A_list[:N]

if sum(attack_A_list) >= 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):
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()))
t = 0

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

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

Solution (Python):
H,N=map(int,input().split())
A=list(map(int,input().split()))
sum=0
for a in A:
    sum+=a

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

Solution (Python):
ni = lambda: int(input())
nm = lambda: map(int, input().split())
nl = lambda: list(map(int, input().split()))

h,n = nm()
a = nl()

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

Solution (Python):
import sys
import math
from collections import deque
from collections import defaultdict

def main():
    h, n = list(map(int,sys.stdin.readline().split()))
    A = list(map(int,sys.stdin.readline().split()))
    print("Yes") if sum(A) >= h else print("No")
    return 0

if __name__ == "__main__":
    main()

Solution (Python):
H, N = map(int, input().split())
A = list(map(int, input().split()))
ans = 'No'
for i in A:
    H -= i
    if H <= 0:
        ans = 'Yes'
        break
print(ans)

Solution (Python):
h, b = list(map(int, input().split()))
a = sorted(list(map(int, input().split())), reverse=True)
for i in a:
    h -= i
    if h <= 0:
        print('Yes')
        exit()
print('No')

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

Solution (Python):
h,n=map(int,input().split())
a=sum(list(map(int,input().split())))
if(h-a<=0):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 = list(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 = map(int, input().split())
print("Yes" if h <= sum(a) else "No")

Solution (Python):
h,n=map(int,input().split())
lst=list(map(int,input().split()))
for i in range(n):
  h-=lst[i]
print("Yes" if h<=0 else "No")

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

if sum(an) >= 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):
    print('Yes')
else:
    print('No')

Solution (Python):
import math 
import sys 

t=1
for _ in range(t):
    n,m=map(int,input().split())
    l=list(map(int,input().split()))
    if sum(l)>=n:
        print("Yes")
    else:
        print("No")

Solution (Python):
h,n=map(int,input().split())
a=list(map(int,input().split()))
sum=0
for i in range(n):
    sum+=a[i]
print('Yes' if sum>=h else '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=[0]*n
a[:]=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 numpy as np
h, n = map(int, input().split())
a = np.array(list(map(int, input().split()))).sum()

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

Solution (Python):
h,n,*a = map(int,open(0).read().split())
print('YNeos'[h>sum(a)::2])

Solution (Python):
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()))
for i in range(n):
    h = h - a[i]
if h > 0:
    print('No')
else:
    print('Yes')

Solution (Python):
import math
import time
from collections import defaultdict, deque
from sys import stdin, stdout
from bisect import bisect_left, bisect_right
n,k=map(int,stdin.readline().split())
a=list(map(int,stdin.readline().split()))
if(sum(a)>=n):
    print("Yes")
else:
    print("No")

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

ans = "No"
for n in range(N):
    H -= A[n]
    if H <= 0:
        ans = "Yes"
        break
print(ans)

Solution (Python):


def f(h, n, a):
    if sum(a) >= h:
        print('Yes')
    else:
        print('No')

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

Solution (Python):
h,n = map(int,input().split())
l = list(map(int,input().split()))
count = 0
for i in l:
    count += i
if count >= h:
    print("Yes")
else:
    print("No")