#include <bits/stdc++.h>
using namespace std;
long long a, b, n;
long long ans = 1e18;
pair<long long, long long> ansp;
void task() {
  cin >> n >> a >> b;
  n *= 6;
  bool sw = 0;
  if (a * b >= n) {
    cout << a * b << "\n";
    cout << a << ' ' << b;
    return;
  }
  if (b < a) {
    sw = 1;
    swap(a, b);
  }
  for (; a <= 1e7; ++a) {
    long long need = max(b, n / a + (n % a > 0));
    if (need * a < ans) {
      ans = need * a;
      ansp = {a, need};
    }
  }
  if (sw) swap(ansp.first, ansp.second);
  cout << ans << "\n";
  cout << ansp.first << ' ' << ansp.second;
}
int main() {
  task();
  return 0;
}
