Problem Description

Bitaro the Beaver has decided to go home for a visit. He will arrive at his home on the morning of $A$ days from now and leave on the morning of $B$ days from now. Upon hearing this, Biba the Beaver decided to visit Bitaro's home on the afternoon of $C$ days from now. Determine if Biba can meet Bitaro.

Input Format

The input is given from the standard input in the following format:

$ A $ $ B $ $ C $

Output Format

Output $ 1 $ if Biba can meet Bitaro, otherwise output $ 0 $.

Sample Input and Output

Sample Input #1

2 5 3

Sample Output #1

1

Sample Input #2

20 22 19

Sample Output #2

0

Sample Input #3

24 30 30

Sample Output #3

0

Sample Input #4

1 100 99

Sample Output #4

1

Notes/Hints

Constraints

• $1 \leq A < B \leq 100$.
• $1 \leq C \leq 100$.

Sample Explanation 1

Bitaro will be home from the morning of $2$ days from now until the morning of $5$ days from now. In contrast, Biba will visit Bitaro's home on the afternoon of $3$ days from now. Therefore, Biba can meet Bitaro, so output $1$.

Sample Explanation 2

Bitaro will be home from the morning of $20$ days from now until the morning of $22$ days from now. In contrast, Biba will visit Bitaro's home on the afternoon of $19$ days from now, but at that time, Bitaro has not yet started his home visit. Therefore, Biba cannot meet Bitaro, so output $0$.

见题面 Input 部分

见题面 Output 部分