Problem:
 Score : 100 points    Problem Statement An elementary school student Takahashi has come to a variety store.  He has two coins, A -yen and B -yen coins (yen is the currency of Japan), and wants to buy a toy that costs C yen. Can he buy it?  Note that he lives in Takahashi Kingdom, and may have coins that do not exist in Japan.      Constraints  All input values are integers.  1 \leq A, B \leq 500  1 \leq C \leq 1000         Input Input is given from Standard Input in the following format:  A  B  C       Output If Takahashi can buy the toy, print Yes ; if he cannot, print No .        Sample Input 1 50 100 120      Sample Output 1 Yes  He has 50 + 100 = 150 yen, so he can buy the 120 -yen toy.       Sample Input 2 500 100 1000      Sample Output 2 No  He has 500 + 100 = 600 yen, but he cannot buy the 1000 -yen toy.       Sample Input 3 19 123 143      Sample Output 3 No  There are 19 -yen and 123 -yen coins in Takahashi Kingdom, which are rather hard to use.       Sample Input 4 19 123 142      Sample Output 4 Yes

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

    if a + b >= c:
        print('Yes')
    else:
        print('No')

if __name__ == '__main__':
    main()

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

if a+b >= c:
    print('Yes')
else:
    print('No')

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

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

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

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

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

Solution (Python):
def actual(a, b, c):
    if a + b >= c:
        return 'Yes'

    return 'No'

a, b, c = map(int, input().split())
print(actual(a, b, c))

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

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

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

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


if c <= a + b:
    print('Yes')
else:
    print('No')

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

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

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

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

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

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

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

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

if a+b >= c:
  print("Yes")
else:
  print("No")

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

Solution (Python):
A,B,C = map(int,input().split())

if A+B>=C:
  print("Yes")
else:
  print("No")

Solution (Python):
A,B,C = map(int,input().split())

print('Yes' if A + B >= C else 'No')

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

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

x = a + b - c

if x >= 0:
  print('Yes')
else:
  print('No')

Solution (Python):
A,B,C=map(int,input().split())

if A+B>=C:
  print("Yes")
else:
  print("No")

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

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

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

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

print("Yes" if a+b >=c else "No")

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

Solution (Python):
def main():
  a, b,c = map(int ,input().split())
  if a + b >= c:
    print('Yes')
    exit()
  print('No')
if __name__ == '__main__':
  main()

Solution (Python):
A,B,C=map(int,input().split())

if C>A+B:
  print('No')
else:
  print('Yes')

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

Solution (Python):
import sys
sys.setrecursionlimit(10**6)

a,b,c=map(int,input().split())

if c<=a+b:
    print("Yes")
else:
    print("No")

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

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

Solution (Python):
A =list(map(int, input().split()))
if A[0]+A[1]>=A[2]:
    print('Yes')
else:
    print('No')

Solution (Python):

a,b,c=map(int,input().split())

print('Yes' if c<=(a+b) else 'No')

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

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

if a+b>=c:
    print('Yes')
else:
    print('No')

Solution (Python):
import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines

a, b, c = map(int, readline().split())

print('Yes' if (a+b) >= c else 'No')

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

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

Solution (Python):
A,B,C = map(int,input().split())
print("YNeos"[A+B<C::2])

Solution (Python):
A, B, C = map(int, input().split())

if A + B >= C:
    print("Yes")
else:
    print("No")

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

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

Solution (Python):
A, B, C = map(int, input().split())

if A+B>=C:
  print("Yes")
else:
  print("No")

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

Solution (Python):
x = input().split()
a = int(x[0])
b = int(x[1])
c = int(x[2])
d = (a + b) - c
if d >= 0:
  print('Yes')
else:
  print('No')

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

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

if a+b<c:
    print('No')
else:
    print('Yes')

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

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

Solution (Python):


import sys






























def main():
    mod = 1000000007                
    inf = float('inf')              
    
    sys.setrecursionlimit(10**6)    
    def input(): return sys.stdin.readline().rstrip()
    def ii():    return int(input())
    def mi():    return map(int, input().split())
    def mi_0():  return map(lambda x: int(x)-1, input().split())
    def lmi():   return list(map(int, input().split()))
    def lmi_0(): return list(map(lambda x: int(x)-1, input().split()))
    def li():    return list(input())
    
    
    a, b, c = mi()
    print('Yes') if a + b >= c else print('No')


if __name__ == "__main__":
    main()

Solution (Python):
x, y, z = map(int, input().split())
if x + y >= z:
    print("Yes")
else:
    print("No")

Solution (Python):
import sys

def IS(): return sys.stdin.readline().rstrip()
def II(): return int(IS())
def MII(): return list(map(int, IS().split()))
def MIIZ(): return list(map(lambda x: x-1, MII()))

def DD2(d1,d2,init=0): return [[init]*d2 for _ in range(d1)]
def DD3(d1,d2,d3,init=0): return [DD2(d2,d3,init) for _ in range(d1)]

def to_bin(x: int) -> str: return format(x, 'b') 
def to_oct(x: int) -> str: return format(x, 'o') 
def to_hex(x: int) -> str: return format(x, 'x') 
MOD=10**9+7
def divc(x,y) -> int: return -(-x//y)
def divf(x,y) -> int: return x//y
def gcd(x,y):
    while y: x,y = y,x%y
    return x
def lcm(x,y): return x*y//gcd(x,y)
def enumerate_divs(n):
    """Return a tuple list of divisor of n"""
    return [(i,n//i) for i in range(1,int(n**0.5)+1) if n%i==0]
def get_primes(MAX_NUM=10**3):
    """Return a list of prime numbers n or less"""
    is_prime = [True]*(MAX_NUM+1)
    is_prime[0] = is_prime[1] = False
    for i in range(2, int(MAX_NUM**0.5)+1):
        if not is_prime[i]: continue
        for j in range(i*2, MAX_NUM+1, i):
            is_prime[j] = False
    return [i for i in range(MAX_NUM+1) if is_prime[i]]

from itertools import accumulate as acc
from collections import deque, Counter
from heapq import heapify, heappop, heappush
from bisect import bisect_left


def main():
    a,b,c = MII()
    if a+b>=c: print('Yes')
    else: print('No')


if __name__ == '__main__':
    main()

Solution (Python):
import sys

def IS(): return sys.stdin.readline().rstrip()
def II(): return int(IS())
def MII(): return list(map(int, IS().split()))
def MIIZ(): return list(map(lambda x: x-1, MII()))

def DD2(d1,d2,init=0): return [[init]*d2 for _ in range(d1)]
def DD3(d1,d2,d3,init=0): return [DD2(d2,d3,init) for _ in range(d1)]

def to_bin(x: int) -> str: return format(x, 'b') 
def to_oct(x: int) -> str: return format(x, 'o') 
def to_hex(x: int) -> str: return format(x, 'x') 
MOD=10**9+7
def divc(x,y) -> int: return -(-x//y)
def divf(x,y) -> int: return x//y
def gcd(x,y):
    while y: x,y = y,x%y
    return x
def lcm(x,y): return x*y//gcd(x,y)
def enumerate_divs(n):
    """Return a tuple list of divisor of n"""
    return [(i,n//i) for i in range(1,int(n**0.5)+1) if n%i==0]
def get_primes(MAX_NUM=10**3):
    """Return a list of prime numbers n or less"""
    is_prime = [True]*(MAX_NUM+1)
    is_prime[0] = is_prime[1] = False
    for i in range(2, int(MAX_NUM**0.5)+1):
        if not is_prime[i]: continue
        for j in range(i*2, MAX_NUM+1, i):
            is_prime[j] = False
    return [i for i in range(MAX_NUM+1) if is_prime[i]]

from itertools import accumulate as acc
from collections import deque, Counter
from heapq import heapify, heappop, heappush
from bisect import bisect_left


def main():
    a,b,c = MII()
    if a+b>=c: print('Yes')
    else: print('No')


if __name__ == '__main__':
    main()

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

Solution (Python):
import sys

def IS(): return sys.stdin.readline().rstrip()
def II(): return int(IS())
def MII(): return list(map(int, IS().split()))
def MIIZ(): return list(map(lambda x: x-1, MII()))

def DD2(d1,d2,init=0): return [[init]*d2 for _ in range(d1)]
def DD3(d1,d2,d3,init=0): return [DD2(d2,d3,init) for _ in range(d1)]

def to_bin(x: int) -> str: return format(x, 'b') 
def to_oct(x: int) -> str: return format(x, 'o') 
def to_hex(x: int) -> str: return format(x, 'x') 
MOD=10**9+7
def divc(x,y) -> int: return -(-x//y)
def divf(x,y) -> int: return x//y
def gcd(x,y):
    while y: x,y = y,x%y
    return x
def lcm(x,y): return x*y//gcd(x,y)
def enumerate_divs(n):
    """Return a tuple list of divisor of n"""
    return [(i,n//i) for i in range(1,int(n**0.5)+1) if n%i==0]
def get_primes(MAX_NUM=10**3):
    """Return a list of prime numbers n or less"""
    is_prime = [True]*(MAX_NUM+1)
    is_prime[0] = is_prime[1] = False
    for i in range(2, int(MAX_NUM**0.5)+1):
        if not is_prime[i]: continue
        for j in range(i*2, MAX_NUM+1, i):
            is_prime[j] = False
    return [i for i in range(MAX_NUM+1) if is_prime[i]]

from itertools import accumulate as acc
from collections import deque, Counter
from heapq import heapify, heappop, heappush
from bisect import bisect_left


def main():
    a,b,c = MII()
    if a+b>=c: print('Yes')
    else: print('No')


if __name__ == '__main__':
    main()

Solution (Python):

import sys
sys.setrecursionlimit(10**9)
INF=10**18
MOD=10**9+7
input=lambda: sys.stdin.readline().rstrip()
YesNo=lambda b: bool([print('Yes')] if b else print('No'))
YESNO=lambda b: bool([print('YES')] if b else print('NO'))
int1=lambda x:int(x)-1

def main():
    A,B,C=map(int,input().split())
    YesNo(A+B>=C)

if __name__ == '__main__':
    main()

Solution (Python):
a,b,c=map(int,input().split())
print('YNeos'[a+b<c::2])

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

Solution (Python):
import collections


def inputStrOnebyOne():
    s = list(input())
    return s


def inputOnebyOne_Int():
    a = list(int(x) for x in input().split())
    return a

def main():
    yen = inputOnebyOne_Int()
    if(yen[2] <= yen[0]+yen[1]):
        print("Yes")
    else:
        print("No")

if __name__=='__main__':
    main()

Solution (Python):
A, B, C = map(int, input().split())
print('No' if A + B < C else 'Yes')

Solution (Python):


a, b, c = map(int, input().split())
print('Yes' if a + b >= c else 'No')

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

if a + b >= c:
    print('Yes')
else:
    print('No')

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

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

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

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

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

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

Solution (Python):
import sys
def input(): return sys.stdin.readline().strip()

def resolve():
    a,b,c=map(int, input().split())
    if a+b>=c:
        print('Yes')
    else:
        print('No')
resolve()

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

Solution (Python):
ABC = input()
ABC = list(ABC.split())

A = int(ABC[0])
B = int(ABC[1])
C = int(ABC[2])

if A+B >= C:
  print('Yes')
else:
  print("No")

Solution (Python):

A, B, C = map(int, input().split())
print(['No', 'Yes'][A + B >= C])

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

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

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

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

Solution (Python):
def resolve():
	a, b, c = map(int, input().split())
	if (a + b) >= c:
		print('Yes')
	else:
		print('No')
resolve()

Solution (Python):

"""
Created on Wed May 13 17:58:03 2020

@author: shinba
"""


a,b,c = map(int,input().split())

if a+b >= c:
    print("Yes")
else:
    print("No")

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

Solution (Python):






import sys
input = sys.stdin.readline

import math
from collections import deque
from fractions import gcd
from functools import lru_cache






MOD = 10**9+7
INF = float('inf')






def inputI(): return int(input().strip())
def inputS(): return input().strip()
def inputIL(): return list(map(int,input().split()))
def inputSL(): return list(map(str,input().split()))
def inputILs(n): return list(int(input()) for _ in range(n))
def inputSLs(n): return list(input().strip() for _ in range(n))
def inputILL(n): return [list(map(int, input().split())) for _ in range(n)]
def inputSLL(n): return [list(map(str, input().split())) for _ in range(n)]


def inv(n): return pow(n, MOD-2, MOD)


kaijo_memo = []
def kaijo(n):
  if(len(kaijo_memo) > n):
    return kaijo_memo[n]
  if(len(kaijo_memo) == 0):
    kaijo_memo.append(1)
  while(len(kaijo_memo) <= n):
    kaijo_memo.append(kaijo_memo[-1] * len(kaijo_memo) % MOD)
  return kaijo_memo[n]

gyaku_kaijo_memo = []
def gyaku_kaijo(n):
  if(len(gyaku_kaijo_memo) > n):
    return gyaku_kaijo_memo[n]
  if(len(gyaku_kaijo_memo) == 0):
    gyaku_kaijo_memo.append(1)
  while(len(gyaku_kaijo_memo) <= n):
    gyaku_kaijo_memo.append(gyaku_kaijo_memo[-1] * pow(len(gyaku_kaijo_memo),MOD-2,MOD) % MOD)
  return gyaku_kaijo_memo[n]

def nCr(n,r):
  if(n == r):
    return 1
  if(n < r or r < 0):
    return 0
  ret = 1
  ret = ret * kaijo(n) % MOD
  ret = ret * gyaku_kaijo(r) % MOD
  ret = ret * gyaku_kaijo(n-r) % MOD
  return ret


def factorization(n):
    arr = []
    temp = n
    for i in range(2, int(-(-n**0.5//1))+1):
        if temp%i==0:
            cnt=0
            while temp%i==0:
                cnt+=1
                temp //= i
            arr.append([i, cnt])
    if temp!=1:
        arr.append([temp, 1])

    if arr==[]:
        arr.append([n, 1])
    return arr


def lcm(a, b):
    return a * b // gcd (a, b)





A,B,C = inputIL()

if A+B>=C:
  print("Yes")
else:
  print("No")

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

Solution (Python):
import sys
import math
import bisect

def main():
    a, b, c = map(int, input().split())
    if a + b >= c:
        print('Yes')
    else:
        print('No')

if __name__ == "__main__":
    main()

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

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

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

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

Solution (Python):
A,B,C= map(int, input().split())




print("Yes" if A + B >= C else "No")

Solution (Python):

a,b,c = map(int,input().split())

print("Yes" if a+b >= c else "No")

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

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

if a+b >= c:
    print('Yes')
else:
    print('No')

Solution (Python):
def ABC_91_A():
    A,B,C = map(int, input().split())
    
    if A+B>=C:
        print('Yes')
    else:
        print('No')

if __name__ == '__main__':

    ABC_91_A()

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

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

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

Solution (Python):
def main():
    a,b,c = (int(x) for x in input().split())
    print('Yes' if a+b>=c else 'No')

if __name__ == '__main__':
    main()

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

Solution (Python):
a,b,c = map(int,input().split())
s = "YNeos"
print(s[(a+b<c)::2])

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

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

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

Solution (Python):

import sys
import math
from bisect import bisect_left, bisect_right, insort_left, insort_right
from collections import defaultdict, deque, Counter
from copy import deepcopy
from fractions import gcd
from functools import lru_cache, reduce
from heapq import heappop, heappush
from itertools import accumulate, groupby, product, permutations, combinations, combinations_with_replacement
from math import ceil, floor, factorial, log, sqrt, sin, cos
from operator import itemgetter
from string import ascii_lowercase, ascii_uppercase, digits
sys.setrecursionlimit(10**7)
rs = lambda: sys.stdin.readline().rstrip()
ri = lambda: int(rs())
rf = lambda: float(rs())
rs_ = lambda: [_ for _ in rs().split()]
ri_ = lambda: [int(_) for _ in rs().split()]
rf_ = lambda: [float(_) for _ in rs().split()]
INF = float('inf')
MOD = 10 ** 9 + 7
PI = math.pi

A, B, C = ri_()
print('Yes' if C <= A + B else 'No')

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

if a+b >= c:
    print("Yes")
else:
    print("No")

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

print('Yes') if c <= a + b else print('No')

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

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

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

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

Solution (Python):

import sys
input = sys.stdin.readline









A,B,C = map(int,input().split())

print("Yes" if A+B >= C else "No")

Solution (Python):
a,b,c=map(int,input().split());print("YNeos"[a+b<c::2])

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

Solution (Python):

A, B, C = map(int, input().split())

print("Yes" if (A+B)>=C else "No")

Solution (Python):
a=list(map(int,input().split()))
print(['No','Yes'][a[0]+a[1]>=a[2]])

Solution (Python):
A, B, C = map(int, input().split())

sum = A + B

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

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

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

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

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

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

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

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

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

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

if a+b >=c:
    print("Yes")
else:
    print("No")

Solution (Python):


a, b, c = map(int, input().split())

if a + b >= c:
    print("Yes")
else:
    print("No")

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

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

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

if a+b >= c:
  print('Yes')
else:
  print('No')

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

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

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

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

Solution (Python):
A,B,C = map(int, input().split())

print('Yes' if A+B >= C else 'No')

Solution (Python):
import sys
import itertools
sys.setrecursionlimit(1000000000)
from heapq import heapify,heappop,heappush,heappushpop

import collections

a,b,c = map(int,input().split())
if a + b >= c:
    print("Yes")
else:
    print("No")

Solution (Python):
a,b,c = list(map(int,input().split()))
print(['No','Yes'][int(a+b>=c)])

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

Solution (Python):


a, b, c = map(int, input().split())
if a + b >= c:
    print('Yes')
else:
    print('No')

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

if a + b >= c:
  print('Yes')
else:
  print('No')

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

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

Solution (Python):
a,b,c=map(int,input().split())
print(["Yes","No"][a+b<c])

Solution (Python):
A,B,C = map(int,input().split())

if A+B >= C:
    print('Yes')
else:
    print('No')

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

Solution (Python):
x = input().split()
a = int(x[0])
b = int(x[1])
c = int(x[2])
d = (a + b) - c
if d >= 0:
  print('Yes')
else:
  print('No')

Solution (Python):
a,b,c = map(int, input().split())
print('YNeos'[a+b<c::2])

Solution (Python):
A, B, C = map(int, input().split())

if A+B >= C:
    print('Yes')
else:
    print('No')

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

Solution (Python):
A, B, C = map(int, input().split())
ans = 'Yes' if A + B >= C else 'No'
print(ans)

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

Solution (Python):
import sys, re
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians
from itertools import accumulate, permutations, combinations, product, groupby
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits
from bisect import bisect, bisect_left
from fractions import gcd
from heapq import heappush, heappop
from functools import reduce
def input(): return sys.stdin.readline().strip()
def INT(): return int(input())
def MAP(): return map(int, input().split())
def LIST(): return list(map(int, input().split()))
def ZIP(n): return zip(*(MAP() for _ in range(n)))
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
mod = 10 ** 9 + 7

A, B, C = MAP()
print("Yes" if A+B >= C else "No")

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

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

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

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

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

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

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

Solution (Python):
args = input().split()
a = int(args[0])
b = int(args[1])
c = int(args[2])

if a + b >= c:
  print('Yes')
else:
  print('No')

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

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

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

def main():
  A,B,C = map(int, input().split())
  if C <= A+B:
    print('Yes')
  else:
    print('No')

if __name__ == "__main__":
  main()

Solution (Python):
A,B,C=map(int,input().split())
print('No' if A+B<C else 'Yes')

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

Solution (Python):
import math, sys
from bisect import bisect_left, bisect_right
from collections import Counter, defaultdict, deque
from copy import deepcopy
from functools import lru_cache
from heapq import heapify, heappop, heappush
from itertools import accumulate, combinations, permutations
input = sys.stdin.readline
mod = 10**9 + 7
ns = lambda: input().strip()
ni = lambda: int(input().strip())
nm = lambda: map(int, input().split())
nl = lambda: list(map(int, input().split()))

def main():
    a, b, c = nm()

    if a + b >= c:
        print('Yes')
    else:
        print('No')
        

if __name__ == '__main__':
    main()

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

Solution (Python):
a, b, c = map(int, input().split())
print(['No', 'Yes'][a+b>=c])

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

Solution (Python):
def main():
    A, B, C = map(int, input().split())
    if A + B >= C:
        print("Yes")
    else:
        print("No")
if __name__ == "__main__":
    main()

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

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

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

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

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

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

if a+b >= c:
    print('Yes')
else:
    print('No')

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

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

Solution (Python):
A, B, C = input().split(' ')
if int(C) <= (int(A) + int(B)):
    print('Yes')
else:
    print('No')

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

Solution (Python):
A, B, C = map(int, input().split())

print("Yes" if A + B >= C else "No")

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

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

Solution (Python):
def main():
    a,b,c = map(int, input().split())
    if a+b >= c:
        print('Yes')
    else:
        print('No')


if __name__ == '__main__':
    main()

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

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

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

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

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