#include <bits/stdc++.h>
using namespace std;
int main() {
  long long t[2], ans[2], best, n;
  cin >> n >> t[0] >> t[1];
  n = 6 * n;
  if (n <= t[0] * t[1]) {
    cout << t[0] * t[1] << "\n" << t[0] << " " << t[1];
    return 0;
  }
  int k = 0;
  if (t[0] > t[1]) k = 1;
  best = (long long)10e10;
  for (long long i = t[k]; i <= sqrt(n); i++) {
    long long d;
    if (n % i == 0)
      d = n / i;
    else
      d = n / i + 1;
    d = max(t[1 - k], d);
    if (best > d * i) {
      best = d * i;
      ans[k] = i;
      ans[1 - k] = d;
    }
  }
  cout << best << "\n" << ans[0] << " " << ans[1];
  return 0;
}
