#include <bits/stdc++.h>
using namespace std;
long long n, a, b;
void solve() {
  long long i, can, val1, val2, vt1, vt2, ans;
  bool flag;
  n = n * 6ll;
  if (a * b >= n) {
    cout << a * b << endl;
    cout << a << " " << b << endl;
    return;
  }
  flag = false;
  if (a > b) {
    swap(a, b);
    flag = true;
  }
  ans = 1ll << 50;
  for (i = 1ll; i * i <= n; i++) {
    val1 = i;
    if (n % i == 0)
      val2 = n / i;
    else
      val2 = n / i + 1ll;
    val1 = ((val1) > (a) ? (val1) : (a));
    val2 = ((val2) > (b) ? (val2) : (b));
    if (val1 * val2 < ans) {
      ans = val1 * val2;
      vt1 = val1;
      vt2 = val2;
    }
  }
  if (flag) swap(vt1, vt2);
  cout << ans << endl;
  cout << vt1 << " " << vt2 << endl;
}
void input() {
  cin >> n >> a >> b;
  solve();
}
int main() {
  input();
  fclose(stdin);
  fclose(stdout);
  return 0;
}
