#include<iostream>
#include<sstream>
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<string>
#include<vector>
#include<cmath>
#include<set>
#include<map>
#include<stack>
#include<queue>
#include<numeric>
#include<functional>
#include<complex>
#include<cassert>

using namespace std;
#define BET(a,b,c) ((a)<=(b)&&(b)<(c))
#define FOR(i,n) for(int i=0,i##_end=(int(n));i<i##_end;i++)
#define SZ(x) (int)(x.size())
#define ALL(x) (x).begin(),(x).end()
#define MP make_pair
#define CLS(x,val) memset((x) , val , sizeof(x)) 
#define FOR_EACH(it,v) for(__typeof(v.begin()) it=v.begin(),it_end=v.end() ; it != it_end ; it++)
typedef long long ll_t;
typedef long double ld_t;
typedef vector<int> VI;
typedef vector<VI> VVI;

long long gcd (long long s , long long t) { return t ? gcd(t,s%t) : s ; }
long long lcm (long long s, long long t) { return s / gcd(s, t) * t; }

int main()
{
    long long A,B,T;
    cin>>A>>B>>T;
    long long ans = 1LL<<60;
    
    if(A > B) swap(A, B);
    long long g = gcd(A, B);
    long long l = lcm(A, B);
    if(l <= T){
        ans = T + (g - (T - l + g) % g) % g;
    }else {
        for(int b=0;b*B<=T+B;b++){
            long long rem = T - b * B;
            long long need = rem > 0 ? (rem - 1) / A + 1 : 0;
            ans = min(ans, b * B + need * A);
        }
    }

    cout<<ans<<endl;
    return 0;
}