Shopping Street

In Izua Village, there is a shopping street along the east-west road. Yae lives at the west end of the shopping street and Takeko lives at the east end. They are trying to walk from their house to Joe's store along the street. However, since Yae and Takeko are still small, they can't walk very far from their house.

Given the length of the shopping street, the maximum distance they can walk, and the distance along the street from the west end of the shopping street to Joe's store, write a program to calculate if Yae and Takeko can walk to the store. Note that the maximum distance they can walk is the same for both of them.

Input

The input is given in the following form.

$w$ $m$ $s$

In one line, the length of the shopping street $w$ ($2 \leq w \leq 1,000$), the maximum distance they can walk $m$ ($0 \leq m \leq 500$), and the distance along the street from the west end of the shopping street to Joe's store $s$ ($0 < s < w$) are given as integers.

Output

Output 0 when neither of them can reach the destination, 1 when only Yae can reach the destination, 2 when only Takeko can reach the destination, and 3 when both of them can reach the destination on a single line.

Sample Input and Output

Sample Input 1

200 50 30	

Sample Output 1

1

Sample Input 2

300 100 200	

Sample Output 2

2

Sample Input 3

500 300 300	

Sample Output 3

3

入力例４

1000 400 450	

出力例４

0

---