#include #include #include #include #include #include #include #include #include #include #include #include #include #include using namespace std; inline int toInt(string s) { int v; istringstream sin(s); sin >> v; return v; } template inline string toString(T x) { ostringstream sout; sout << x; return sout.str(); } template inline T sqr(T x) { return x*x; } typedef pair P; typedef long long ll; typedef unsigned long long ull; #define FOR(i,a,b) for(int i=(a);i<(b);++i) #define REP(i,n) FOR(i,0,n) #define CLR(a) memset((a), 0 ,sizeof(a)) #define MCLR(a) memset((a), -1 ,sizeof(a)) #define ALL(a) (a).begin(),(a).end() #define RALL(a) (a).rbegin(), (a).rend() #define SZ(a) (sizeof(a)) #define FILL(a,v) fill((int*)a,(int*)(a+(SZ(a)/SZ(*(a)))),v) bool cheak(int x, int y, int xMax, int yMax){ return x >= 0 && y >= 0 && xMax > x && yMax > y; } const int dx[4] = { -1, 0, 1, 0 }, dy[4] = { 0, 1, 0, -1 }; const int mod = 1000000007; const int INF = 2147483647; int main() { ll a, b, t; cin >> a >> b >> t; ll Min = INF; for (int i = 0; i < 1000; i++) { for (int j = 0; j < 1000; j++){ int n = a*i + b*j; if (n){ if (t % n == 0) Min = t; else Min = min(t + n - t % n, Min); } } } cout << Min << endl; return 0; }