def sieve(n)
  prime = (2..n).to_a
  2.upto(Math.sqrt(n)) { |i|
    prime.reject! { |v|
      v % i == 0 && v != i
    }
  }
  return prime
end

prime = sieve(100000)

loop do
  m, a, b = gets.chomp.split.map(&:to_i)

  if (m || a || b) == 0
    break
  end

  ans_p = 1;
  ans_q = 1;

  for i in prime
    for j in prime
      if i * j > m
        break
      end
      if i > j
        next
      end
      if a * j > b * i
        next
      end
      if ans_p * ans_q >=  i * j
        next
      end
      ans_p = i
      ans_q = j
    end
  end

  puts "#{ans_p} #{ans_q}"
  
end