#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
ll gcd(ll x, ll y) { return y ? gcd(y, x % y) : x; }
ll lcm(ll a, ll b){return a * b / gcd(a, b);}

int main(){
    ll a,b,k;
    cin>>a>>b>>k;
    ll n=lcm(a,b);
    vector<ll> x;
    for(int i=1;i<=n;i++){
        if(i%a==0||i%b==0)x.push_back(i);
    }
    //cout<<n<<" "<<x.size()<<" ";
    if(k<=x.size()){
        cout<<x[k-1]<<endl;
    }else{
        ll amari=k%x.size();
        ll bai=k/x.size();
        cout<<bai*n+x[amari-1]<<endl;
    }
    return 0;
}