#include <iostream>
#include <vector>
#include <map>
#include <algorithm>
using namespace std;

#define REP(i,s,e) for (i = s; i <= e; i++)
#define rep(i,n) REP (i,0,(int)(n)-1)
#define RREP(i,s,e) for (i = s; i >= e; i--)
#define rrep(i,n) RREP (i,(int)(n)-1,0)
#define INF (int)1e8
#define MOD (int)(1e9+7)

typedef long long ll;

int gcd(int a, int b) {
    return b == 0 ? a : gcd(b,a%b);
}

int lcm(int a, int b) {
    return (ll) a * b / gcd(a,b);
}

int main(void) {
    int a, b, t;
    cin >> a >> b >> t;
    int ans = ((t-1) / b + 1) * b;
    for (int n = t / lcm(a,b) * lcm(a,b); n < t; n += b)
        ans = min(ans,((t-n-1) / a + 1) * a + n);
    cout << ans << endl;
    return 0;
}