#include <iostream>

using namespace std;
using ll=long long;

ll gcd(ll m,ll n){
    if(n==0) return m;
    return gcd(n,m%n);
}
ll lcm(ll x,ll y){
    return x*y/gcd(x,y);
}

int main(){
    ll a,b,c,k;
    cin>>a>>b>>k;
    c=lcm(a,b);

    ll oka=k+1;
    ll nga=1;
    while(oka-nga>1){
        ll cen=(oka+nga)/2;
        ll acen=a*cen;
        ll plc=cen+acen/b-acen/c;
        if(plc>=k){
            oka=cen;
            if(plc==k){
                cout<<acen<<endl;
                return 0;
            }
        }
        else nga=cen;
    }
    ll okb=k+1;
    ll ngb=1;
    while(okb-ngb>1){
        ll cen=(okb+ngb)/2;
        ll bcen=b*cen;
        ll plc=cen+bcen/a-bcen/c;
        if(plc>=k){
            okb=cen;
            if(plc==k){
                cout<<bcen<<endl;
                return 0;
            }
        }
        else ngb=cen;
    }

    return 0;
}