#include<bits/stdc++.h>
using namespace std;
#define ll long long
const int MAXN = 1e6 + 5;

ll n,a,b,sum[MAXN],sum1[MAXN],sum2[MAXN];
int solve(ll sum[], ll nowa, ll nowb)
{
	ll i;
	for(i=1;i<=n;i++)
	{
		if(nowa == a)
		{
			sum[i] ++; nowa = 0;
		}
		if(nowb == b)
		{
			if(sum[i]) return i-1;
			sum[i] ++; nowb = 0;
		}
		nowa ++; nowb ++; sum[i] += sum[i-1];
		//printf("%lld nowans: %lld %lld %lld\n",i,sum[i],nowa,nowb);
	}
	return n;
}

int main()
{
	ll l,l1,l2,d,ans,nowl1,nowl2,p,pls;
	scanf("%lld%lld%lld",&a,&b,&n);
	if(__gcd(a,b) > 1)
	{
		d = a*b/__gcd(a,b)-1;
		ans = d/a+d/b + 2;
		d ++;
		ans += min((n+1-d)/a+(n-d)/b,(n+1-d)/b+(n-d)/a);
		printf("%lld\n",ans);
		return 0;
	}
	l = solve(sum,1,1);
	if(l >= n)
	{
		printf("%lld\n",sum[n]); return 0;
	}
	ans = n;
	d = n-l+1;
	l1 = solve(sum1,a,b-1)-1;
	l2 = solve(sum2,a-1,b)-1;
	//printf("%lld %lld %lld %lld %lld %lld goin!\n",d,l1,l2,sum1[l1],sum2[l2],sum[l]);
	nowl1 = d/l1; nowl2 = 0;
	while(nowl1 >= 0)
	{
		while(l1*nowl1+l2*nowl2+l2 <= d) nowl2 ++;
		p = d-l1*nowl1-l2*nowl2;
		//printf("now: %lld %lld %lld %lld %lld %lld\n",d,nowl1,nowl2,l1,l2,p);
		if(p > 1)
		{
			pls = n;
			if(p <= l1+1) pls = min(pls,sum1[p]);
			if(p <= l2+1) pls = min(pls,sum2[p]);
		}
		else pls = 0;
		//printf("pls: %lld\n",pls);
		ans = min(ans,sum[l]+sum1[l1]*nowl1+sum2[l2]*nowl2+pls);
		nowl1 --;
	}
	printf("%lld\n",ans);
	return 0;
}