#include <iostream>
#include <cstdio>
#include <vector>
#include <algorithm>
#include <utility>
#include <cmath>

using namespace std;

int gcd(int a, int b) {
	return b == 0 ? a : gcd(b, a % b);
}

long long lcm(int a, int b) {
	return (long long) a / gcd(a, b) * b;
}

int main() {
	int a, b, t;

	cin >> a >> b >> t;

	long long lcm_ab = lcm(a, b);

	if (lcm_ab <= t) {
		int gcd_ab = gcd(a, b);
		int ans = ceil(1.0 * t / gcd_ab) * gcd_ab;
		cout << ans << endl;
		return 0;
	}

	int big = max(a, b);
	int small = min(a, b);

	int n_big_max = ceil(1.0 * t / big);
	int pay_big = n_big_max * big;
	int ans = pay_big;

	int left, pay_small;

	for (int i = n_big_max - 1; i >= 0; i--) {
		pay_big = i * big;
		left = t - pay_big;
		pay_small = ceil(1.0 * left / small) * small;
		ans = min(ans, pay_big + pay_small);
	}

	cout << ans << endl;
	return 0;
}