#include <cstdio>
#include <cstdlib>
#include <algorithm>
#include <map>


using namespace std;

int main(){
	int a,b,c;scanf("%d%d%d",&a,&b,&c);
	long long cm=(long long)a*b;if(a>b)swap(a,b);
	int ans=2*1000000000;
	int n=a,m=b;
	int x=0;while(x=m%n){m=n;n=x;}; cm/=n;
	if(cm>c){
		/*for(int i=0;i-b<=c;i+=b){
			int tmp=i+(c-i+a-1)/a*a;if(ans>tmp)ans=tmp;
		}*/
		printf("%d\n",min( (c+a-1)/a*a,(c+b-1)/b*b),(c+cm-1)/cm*cm);return 0;
	}
	printf("%d\n",(c+n-1)/n*n); 
}