// Enjoy your stay.

#include <bits/stdc++.h>

#define EPS 1e-9
#define INF 1070000000LL
#define MOD 1000000007LL
#define fir first
#define foreach(it,X) for(auto it=(X).begin();it!=(X).end();it++)
#define ite iterator
#define mp make_pair
#define mt make_tuple
#define rep(i,n) rep2(i,0,n)
#define rep2(i,m,n) for(int i=m;i<(n);i++)
#define pb push_back
#define sec second
#define sz(x) ((int)(x).size())

using namespace std;

typedef istringstream iss;
typedef long long ll;
typedef pair<ll,ll> pi;
typedef stringstream sst;
typedef vector<ll> vi;

int p[100010],isp[100010],P;

int sieve(int n){
	fill(isp+2,isp+n+1,1);
	int P = 0;
	rep2(i,2,n+1)if(isp[i]){
		p[P++] = i;
		for(int j=i*2;j<=n;j+=i)isp[j]=0;
	}
	return P;
}

int main(){
	cin.tie(0);
	ios_base::sync_with_stdio(0);
	
	P = sieve(100000);
	int m,a,b;
	while(cin>>m>>a>>b && m){
		int ans0,ans1,best=-1;
		rep(i,P){
			if(p[i]*p[i] > m)break;
			int q = min(m/p[i], p[i]*b/a);
			while(!isp[q]) q--;
			if(p[i]*q > best){
				best = p[i]*q;
				ans0 = p[i];
				ans1 = q;
			}
		}
		cout<<ans0<<" "<<ans1<<endl;
	}
}