#include<iostream>
#include<algorithm>
#include<cstring>
#include<set>
#include<vector>

using namespace std;

int main()
{
  int m,a,b;
  bool pp[100001];
  vector<int> prime;
  {
    memset(pp,true,sizeof(pp));
    pp[0]=pp[1]=false;
    for(int i=2;i<100001;i++)
      {
        if(pp[i])
          {
            prime.push_back(i);
            for(int j=i+i;j<100001;j+=i)
              pp[j]=false;
          }
      }
  }

  for(;cin>>m>>a>>b,m;)
    {
      for(;m>0;)
        {
          for(int i=0;i<prime.size();i++)
            {
              if(prime[i]>m/2)
                break;
              if(m%prime[i]==0 &&  pp[m/prime[i]] &&
                 ((double)a/b) <= ((double)(m/prime[i])/prime[i]) &&
                 ((double)(m/prime[i])/prime[i]) <=1
                 )
                {
                  cout<<m/prime[i]<<" "<<prime[i]<<endl;
                  m=-1;
                  i=-1;
                }
            }
          m--;
        }
    }
}