Bitaro the Beaver has decided to return to his hometown. To return home, Bitaro needs $X$ yen if he takes the train, and $Y$ yen if he takes the bus. Moreover, Bitaro cannot return home without taking either the train or the bus. When Bitaro has $Z$ yen, output $1$ if he can return home with the money he has, and $0$ otherwise.

Constraints

• $1 \le X \le 100$.
• $1 \le Y \le 100$.
• $1 \le Z \le 100$.
• All input values are integers.

Input

The input is given in the following format:

X
Y
Z

Output

Output $1$ if Bitaro can return home, and $0$ otherwise.

Do not output anything other than the answer. (Do not output prompt sentences or anything similar.)

Examples

Input 1

7
2
3

Output 1

1

Note 1

• Returning home by train requires $7$ yen, and since Bitaro has $3$ yen, he cannot return home by train.
• Returning home by bus requires $2$ yen, and since Bitaro has $3$ yen, he can return home by bus.

Bitaro can return home. Therefore, output $1$.

Input 2

10
20
1

Output 2

0

Note 2

• Returning home by train requires $10$ yen, and since Bitaro has $1$ yen, he cannot return home by train.
• Returning home by bus requires $20$ yen, and since Bitaro has $1$ yen, he cannot return home by bus.

Bitaro cannot return home. Therefore, output $0$.

Input 3

3
5
3

Output 3

1

Note 3

• Returning home by train requires $3$ yen, and since Bitaro has $3$ yen, he can return home by train.
• Returning home by bus requires $5$ yen, and since Bitaro has $3$ yen, he cannot return home by bus.

Bitaro can return home. Therefore, output $1$.

Input 4

1
1
10

Output 4

1

Note 4

• Returning home by train requires $1$ yen, and since Bitaro has $10$ yen, he can return home by train.
• Returning home by bus requires $1$ yen, and since Bitaro has $10$ yen, he can return home by bus.

Bitaro can return home. Therefore, output $1$.