Homecoming

Time limit2sMemory limit1024 MB

Summary

Bitato is at his parents' house from morning A to morning B, and Bibako arrives on the afternoon of day C. Decide whether they can meet.

Level: Easy1 of 10
Topics: Implementation, Math
Solved: No attempts yet

Problem

The beaver Bitato has decided to go home for a visit. He arrives at his parents' house in the morning A days from today, and leaves the house in the morning B days from today. Upon hearing this, the beaver Bibako decides to visit Bitato's parents' house in the afternoon C days from today. Determine whether Bibako can meet Bitato.

Input

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

A B C

Output

If Bibako can meet Bitato, output 1; otherwise, output 0.

Constraints

1 ≦ A ＜ B ≦ 100.
1 ≦ C ≦ 100.

Examples4

Example 1
Input
```
2 5 3
```
Expected output
```
1
```
Example 2
Input
```
20 22 19
```
Expected output
```
0
```
Example 3
Input
```
24 30 30
```
Expected output
```
0
```
Example 4
Input
```
1 100 99
```
Expected output
```
1
```