#include<iostream>
#include<stdio.h>
#include<string.h>
#include<math.h>
#include<algorithm>
#include<iomanip>
#include<set>
#include<map>
#include<queue>
#include<list>
using namespace std;
inline int gcd(const int& a,const int& b){
	return !b?a:gcd(b,a%b);
}
int main(){
	#define submit
	#ifdef submit
		freopen("ratio.in","r",stdin);
		freopen("ratio.out","w",stdout);
	#endif
	int a,b,l,p1,p2;
	double A,B,ans=0x7fffffff*1.0;
	scanf("%d%d%d",&a,&b,&l);
	B=1.0*a/1.0/b;
	for(int i=1;i<=l;++i){
		for(int j=1;j<=l;++j){
			if(gcd(i,j)!=1)continue;
			A=1.0*i/(1.0*j);
			if(A<B)continue;
			if(A-B<ans){
				ans=A-B;
				p1=i;
				p2=j;
			}
		}
	}
	printf("%d %d",p1,p2);
	#ifndef submit
		system("pause");
	#else
		fclose(stdin);
		fclose(stdout);
	#endif
	return 0;
}