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:
import sys
day,night,totalstairs=raw_input().split()
day=int(day)
night=int(night)
totalstairs=int(totalstairs)
if day>=totalstairs:
	print '1'
	sys.exit()
climbing=day-night
if climbing!=1:
	days=totalstairs/climbing
	rem=totalstairs%climbing
else:
	days=totalstairs-day
	print days+1
	sys.exit()
if rem==0:
	print days-(day/climbing)+1
elif rem==night:
	print days
elif rem<night:
	print days-(night/climbing)
else:
	print days+1