#include<bits/stdc++.h>
#define int long long
using namespace std;
const int N = 1e6 + 10;
int f[N][2];
signed main(){
	int n, a, b;
	cin >> a >> b >> n;
	if(gcd(a, b) > 1){
		cout << min((n + 1) / a + n / b, n / a + (n + 1) / b) << endl;
		return 0;
	}
	int m1 = a * b, m2, m3;
	// m1 = a * b;
	for(int i = 1; i <= b; ++ i){
		if((i * a) % b == b - 1){
			m2 = i * a; break; // BA
		} 
	}
	// m2 = m2 * a;
	for(int i = 1; i <= a; ++ i){
		if((i * b) % a == a - 1){
			m3 = i * b; break; //AB
		}
	}
	// m1 = m1 * b;
	f[0][0] = f[0][1] = 0;
	int s1 = (m2 + 1) / b + m2 / a;
	int s2 = (m3 + 1) / a + m3 / b;
	for(int i = 1; i <= n; ++ i){
		if(i < m2){
			f[i][0] = (i + 1) / b + i / a;
		}else{
			f[i][0] = min(f[i - m2][0], f[i - m2][1]) + s1;
		}
		if(i < m3){
			f[i][1] = i / a + (i + 1) / b;
		}else{
			f[i][1] = min(f[i - m3][0], f[i - m3][1]) + s2;
		}
	}
	if(n < a * b){
		cout << n / a + n / b << endl;
	}else{
		cout << a + b + min(f[n - m1][0], f[n - m1][1]);
	}
}