#include <iostream>
#include <algorithm>
#include <unordered_set>
using namespace std;

typedef long long ll;
ll func(ll a, ll b, ll t)
{
    auto res=(t+b-1)/b*b;
    auto x=b;
    unordered_set<int> s;
    while (true) {
        if (t<b) break;
        auto m=(t-b)%a;
        res=min(res, b+(t-b+a-1)/a*a);
        if (s.count(m) or m==0) break;
        s.insert(m);
        b+=x;
    }
    return res;
}

int main()
{
    long long a, b, t;
    while (cin>>a>>b>>t) {
        cout<<min(func(a, b, t), func(b, a, t))<<endl;
    }
}