#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> pii;
#define FOR(i,a,n) for(int i=a;i<(int)(n);i++)
#define REP(i,n) FOR(i,0,n)
#define ALL(a) (a).begin(),(a).end()
#define MP(a,b) make_pair(a,b)
#define PB(a) push_back(a)
#define F first
#define S second
const int INF = 2000000000;
const int DX[4]={0,1,0,-1}, DY[4]={-1,0,1,0};
struct P{int x;int y;P(int X=0,int Y=0){x=X;y=Y;}};

bool possible(int A, int B, int C) {
	for(int i=0; i<=(C/A); i++) {
		for(int j=0; j<=(C/B); j++) {
			if(A*i + B*j == C) {
				return true;
			}
		}
	}
	return false;
}

int main() {
	int A,B,T;
	cin >> A >> B >> T;
	if(min(A,B) >= T) {
		cout << min(A,B) << endl;
		return 0;
	}
	for(int i=T;;i++) {
		if(possible(A,B,i)) {
			cout << i << endl;
			break;
		}
	}
	return 0;
}