#include<bits/stdc++.h>

using namespace std;
using LL = long long;

const int INF = 1e8 + 5;
const int maxn = 1e6 + 5;
LL F[maxn][3];

int main()
{
	ios::sync_with_stdio(0);
	cin.tie(0);
	
	int n, a, b;
	cin >> a >> b >> n;
	
	LL mi1 = INF, mi2 = INF;
	for(int i = 1; i <= n; ++i){
		if((1LL * i * b + 1) % a == 0){
			mi1 = i * b + 1;
			break;
		}
	}
	for(int i = 1; i <= n; ++i){
		if((1LL * i * a + 1) % b == 0){
			mi2 = i * a + 1;
			break;
		}
	}
	
	for(int i = 0; i <= n; ++i){
		F[i][0] = F[i][1] = F[i][2] = INF;
	}
	
	int d = __gcd(a, b);
	LL ub = 1LL * a * b / d;
	for(int i = 0; i <= n; ++i){
		if(ub >= i){
			F[i][0] = i / a + i / b;
		}
		else{
			int res = i - ub;
			F[i][0] = min(F[i][0], min(F[res + 1][1], F[res + 1][2]) + ub / a + ub / b); 	
		}
		if(mi1 >= i){
			F[i][1] = i / a + max(0, (i - 1) / b);
		}
		else{
			int res = i - mi1;
			F[i][1] = min(F[i][1], min(F[res + 1][1], F[res + 1][2]) + mi1 / a + (mi1 - 1) / b);
		}
		if(mi2 >= i){
			F[i][2] = i / b + max(0, (i - 1) / a);
		}
		else{
			int res = i - mi2;
			F[i][2] = min(F[i][2], min(F[res + 1][1], F[res + 1][2]) + (mi2 - 1) / a + mi2 / b);
		}
		
//		cerr << i << " " << F[i][0] << " " << F[i][1] << " " << F[i][2] << endl;
	}
	cout << F[n][0];
}