Problems
Hyungseok plans to go to his family home for Chuseok.
He will arrive at the family home on the morning of
However, Hyungseok's younger brother, Seokhyeong, decided to visit the family home briefly on the afternoon of
Will Hyungseok and Seokhyeong be able to meet?
Input
Input is provided from standard input in the following format.
A B C
[Constraints]
1 ≤ A < B ≤ 100 .
1 ≤ C ≤ 100 .
Output
Print 1 if they can meet, and 0 otherwise.
Example #1
2 5 3
1
Hyung-seok goes to his family home from the morning of 2 days later until the morning of 5 days later. On the other hand, Seok-hyung visits his family home on the afternoon of 3 days later. Therefore, since the two can meet, output 1.
Example #2
20 22 19
0
Example #3
24 30 30
0
Example #4
1 100 99
1
You must sign in to write code.