#include <bits/stdc++.h>
using namespace std;
#define reep(i,a,b) for(int i=(a);i<(b);i++)
#define rep(i,n) reep((i),0,(n))
typedef pair<long,long> pii;
#define F first
#define S second
bool prime[100010];
vector<long long> v;
int main(){
    long long m,a,b;
    rep(i,100010) prime[i]=true;
    rep(i,2) prime[i]=false;
    for(int i=2;i*i<100010;i++){
        if(prime[i]){
            for(int j=i*i;j<100010;j+=i){
                prime[j]=false;
            }
        }
    }
    rep(i,100010){
        if(prime[i]) v.push_back(i);
    }
    while(cin>>m>>a>>b,m||a||b){
        pii ans(0,0);
        rep(i,v.size()){
            if(v[i]>m) break;
            rep(j,i+1){
                if(v[i]*v[j]>m) break;
                if(a*v[i]<=b*v[j]){
                    if(ans.F*ans.S<v[j]*v[i]){
                        ans=pii(v[j],v[i]);
                    }
                }
            }
        }
        cout<<ans.F<<" "<<ans.S<<endl;
    }
}