#include<bits/stdc++.h>
#define IOS ios::sync_with_stdio(false);cin.tie(0)
#define pb push_back
#define endl "\n"
#define ll long long
#define inf 0x3f3f3f3f
#define pii pair<int,int>
#define yes cout<<"YES"<<endl
#define no cout<<"NO"<<endl
using namespace std;
const int N = 1e6+7,p = 998244353;

int T;
int n,k,j;
int dp[N][2];//0-BA    1-AB
int d0,d1;
int gcd(int x,int y){
	return y==0?x:gcd(y,x%y);
}
void solve(){
	cin>>k>>j>>n;
	int lcm = j*k/gcd(j,k);
	for(int i=1;i<=n;i++){
		if(!d0&&i%k==0&&(i+1)%j==0){
			d0 = i;
		}
		if(!d1&&i%j==0&&(i+1)%k==0){
			d1 = i;
		}
	}
	if(!d0) d0 = n+1;
	if(!d1) d1 = n+1;
	memset(dp,inf,sizeof dp);
	dp[lcm][0] = dp[lcm][1] = lcm/k+lcm/j;
	int ad0 = d0/k+(d0+1)/j,ad1 = d1/j+(d1+1)/k;
	int ans = inf;
	for(int i=1;i<=n;i++){
		if(dp[i][0]==inf){
			dp[i][0] = min((i-d0>0&&dp[i-d0][0]!=inf) ? dp[i-d0][0]+ad0:inf,
			(i-d1>0&&dp[i-d1][1]!=inf) ? dp[i-d1][1]+ad1:inf);
			dp[i][1] = min((i-d0>0&&dp[i-d0][0]!=inf) ? dp[i-d0][0]+ad0:inf,
			(i-d1>0&&dp[i-d1][1]!=inf) ? dp[i-d1][1]+ad1:inf);
		}
		if(i+d0>n){
			ans = min(ans,dp[i][0]+(n-i)/k+(n-i+1)/j);
		}
		if(i+d1>n){
			ans = min(ans,dp[i][1]+(n-i+1)/k+(n-i)/j);
		}
	}
	cout<<ans;
}
signed main(){
	IOS;
//	cin>>T;
	T = 1;
	while(T--){
		solve();
	}
	return 0;
}