#include <iostream>
#include <algorithm>
#include <vector>
#include <cmath>

using namespace std;

vector<int> prime;

void Init() {
  enum { SIZE = 100000 };
  bool t[SIZE];
  fill(t, t + SIZE, true);
  t[0] = t[1] = false;
  for(int i = 0; i < SIZE; ++i) {
    if(t[i]) {
      prime.push_back(i);
      for(int j = i*2; j < SIZE; j += i)
	t[j] = false;
    }
  }
}

int m, a, b;

void Solve() {
  int pp = 0, qq = 0;
  for(int i = 0; i < (int)prime.size(); ++i)
    for(int j = i; j < (int)prime.size(); ++j) {
      long long p = prime[i];
      long long q = prime[j];
      if(p*q > m)
	break;
      if(a * q > p * b)
	continue;
      if(p*q > pp*qq) {
	pp = p;
	qq = q;
      }
    }
  cout << pp << " " << qq << endl;
}

int main() {
  Init();
  while(cin >> m >> a >> b && m) {
    Solve();
  }
}