#include <iostream>
#include <cmath>
using namespace std;

bool prime( int n ) {
  if ( !( n & 1 ) ) { return n == 2; }

  int lim = (int)floor( sqrt( n ) );

  for ( int i = 3; i <= lim; i += 2 ) {
    if ( !( n % i ) ) { return false; }
  }

  return true;
}
int main()
{
  int m, a, b;

  while ( cin >> m >> a >> b && m ) {
    int p = 0, q = 0, max = 0;

    int lim = (int)floor( sqrt( m ) );
    for ( int i = 1; i <= lim; i++ ) {
      if ( prime( i ) ) {
	for ( int j = i; i * j <= m && a*j <= b*i; j++ ) {
	  if ( prime( j ) && i*j > max ) {
	    p = i;
	    q = j;
	    max = p * q;
	  }
	}
      }
    }

    cout << p << " " << q << endl;
  }

  return 0;
}