Migrated from Lutece 498 PUŽ

All parts of this problem, including description, images, samples, data and checker, might be broken. If you find bugs in this problem, please contact the admins.

Description

There is a snail on the ground. It wants to climb to the top of a wooden pole with the height of $V$ meters, measuring from the ground level. In one day it can climb $A$ meters upwards, however during each night it sleeps, sliding $B$ meters back down. Determine the number of days it needs to climb to the top.

Input

The first and only line of input contains three integers separated by a single space: $A$, $B$, and $V$ ($1 \leq B < A \leq V \leq 1 000 000 000$), with meanings described above.

Output

The first and only line of output must contain the number of days that the snail needs to reach the top.

Samples

2 1 5

4

5 1 6

2

100 99 1000000000

999999901

Resources

COCI 2010/2011, 2nd round, November 13th 2010, Author: Stjepan Glavina