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 in C (Clang 3.8.0) (judge verdict: Wrong Answer)

#include <stdio.h>

int main(void) {

    int N, i = 0, j = 0, k = 0;
    int a[300], b[300], c[300], d[300];
    int count = 0;

    scanf("%d", &N);

    for(; i < N; i++){ //赤い点
        scanf("%d %d", &a[i], &b[i]);
    }

    for(; j < N; j++){ //青い点
        scanf("%d %d", &c[j], &d[j]);
    }


    for(; k < N; k++){
        if(a[k] < c[k] || b[k] < d[k]){
            count += 1;
        }
    }

    printf("%d\n", count);


    return 0;
}