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:
st=raw_input()
a,b,n=map(int,st.split())
y=a-b
d=int(n/y)
if(n%y==0):
	d=d-b
x=y*d
if x+b>=n:
	x=x+b
	z=x-n
	q=z/y
	d=d-q
while x<n:
	d=d+1
	x=x+a
	if x>=n:
		break
	x=x-b
print d