#include <iostream>
#include <algorithm>
using namespace std;
typedef long long ll;
ll lcm1,lcm2,lcm3;
ll lcm(ll a,ll b){
    return a/__gcd(a,b)*b;
}
struct node{
    int a,b,c;
};
ll n,m,k;
int check(ll b,ll c){
    if(lcm1 >= lcm2) c--;
    else b --;
    c = max(0ll,c);
    b = max(0ll,b);
    //return lcm1*b+lcm2*c+lcm(n,m)+min(lcm2,lcm1);
    if(lcm1*b+lcm2*c+lcm3+max(lcm2,lcm1) > k) return 1;
    else return 0;
}
int main()
{
    cin>>n>>m>>k;
    if(n==m) {
        cout<<k/m+(k+1)/n<<'\n';
        return 0;
    }
    lcm1 = lcm(n-1,m);
    lcm2 = lcm(n,m-1);
    lcm3 = lcm(n,m);
    ll ans = 0x3f3f3f3f;
    int ix ,ixx;
    for(int i = 0;i<=k;i++){
        ll l = 0,r =k;
        while(l<r){
            ll c = (l+r)>>1;
            if(check(i,c)) r = c;
            else l = c+1;
           // cout<<l<<" "<<r<<" "<<check(i,c)<<'\n';
        }
        //cout<<l<<'\n';
        if((i+k)/n+(l+k)/m < ans){
            ans = (i+k)/n+(l+k)/m;
            ix = i,ixx = l;
        }
    }
    ans = 0;
    int a = 0,b = 0;
    for(int i = 1;i<=k;i++){
    	a++,b++;
    	if(i==lcm3){
    		ans += 2;
    		a = b = 0;
    		if(lcm1>lcm2&&ixx) b++;  
		}
		else if(a%n==0&&b%m==0){
    		ans += 2;
    		a = b = 0;
    		if(ix) a++,ix--;
			else b++,ixx--; 
		}
		else if(a%n==0) {
			ans ++ ;
			a = 0;
		}
		else if(b%m==0){
			ans ++;
			b = 0;
		}
	}
	cout<<ans<<'\n';
    return 0;
}