Problem: Alice is climbing stairs. There are total N stairs. She climbs A stairs upwards in day and she comes downstairs in night by B stairs. Find number of days she will take to reach the top of staircase.   

Input: 
First and only line contains three space separated integers denoting A, B, N.

Output: 
Print only one line of output denoting the answer to the question.

Constraints: 
1 ≤ B<A≤N ≤ 10^9

SAMPLE INPUT
5 1 6

SAMPLE OUTPUT
2

Solution (in PYTHON):

Solution:
A,B,N=map(int,raw_input().split())
steps_per_day=A-B
stairs=N-A
days=stairs/steps_per_day
left_stairs=stairs%steps_per_day
if left_stairs==0:
    print days+1
else:
    print days+2