import java.util.ArrayList;
import java.util.Arrays;
import java.util.Collections;
import java.util.LinkedList;
import java.util.Scanner;
import java.util.TreeSet;

public class Main {
	
	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		
		final long A = sc.nextLong();
		final long B = sc.nextLong();
		final long C = sc.nextLong();
		
		final long X = (A - 1) + B;
		//System.out.println(X + " " + div + " " + mod);
		
		/*
		if(mod == 0){
			System.out.println(div * A);
		}else if(mod <= A - 1){
			System.out.println(div * A + mod);
		}else{
			System.out.println((div + 1) * A);
		}
		*/
		
		System.out.println((C / X) * A + Math.min(A, C % X));
		
	}
}