#include <iostream>
#include <vector>
#include <algorithm>
#include <math.h>

using namespace std;

typedef vector<int> vec;
const int mMax = 100000;

int main()
{
  int m, a, b;
  const int rt = (int)sqrt(mMax);
  char PreTable[mMax];
  memset(PreTable, 0, sizeof(PreTable));
  
  for(int i=2; i<rt+1; i++) {
    int j = i+i;
    while(j<mMax) {
      PreTable[j] = 1;
      j += i;
    } 
  }
  
  vec Table;
  for(int i=2; i<mMax; i++) {
    if(PreTable[i] == 0) {
      Table.push_back(i);
      //    cout << i << " ";

    }
  }
  Table.push_back(mMax+100);


  while(cin >> m >> a >> b) {
    if(m == 0) break;

    int pqMax = 0;
    int pMax = 0;
    int qMax = 0;

    for(int q=2, i=1; q <= mMax; q=Table[i], i++) {
      //    cout << q << endl;
      const int pbUnder = a*q;
      const int pbUpper = b*q;
      const int pUpper  = m/q;

      for(int p=2, j=1; p<=pUpper; p=Table[j], j++) {
	if(pbUnder <= p*b && p*b <= pbUpper) {
	  if(p*q > pqMax) {
	    pqMax = p*q;
	    pMax = p;
	    qMax = q;
	  }
	}
      }
    }
    cout << pMax << " " << qMax << endl;
  }
  
  return 0;
}