#include <bits/stdc++.h>
using namespace std;
inline long long ceil(long long a, long long b) {
  return (a / b + (a % b > 0));
}
int main(void) {
  long long n, a, b, x, y;
  cin >> n >> a >> b;
  n *= 6;
  if (a * b >= n) {
    cout << a * b << endl << a << " " << b;
    return 0;
  }
  if (ceil(n, b) * b < ceil(n, a) * a) {
    x = ceil(n, b);
    y = b;
  } else {
    x = a;
    y = ceil(n, a);
  }
  for (int da = 0, _n = (100100); da < _n; da = da + 1)
    if (x * y > (a + da) * max(b, ceil(n, a + da))) {
      x = a + da;
      y = max(b, ceil(n, a + da));
    }
  for (int db = 0, _n = (100100); db < _n; db = db + 1)
    if (x * y > (b + db) * max(a, ceil(n, b + db))) {
      x = max(a, ceil(n, b + db));
      y = b + db;
    }
  cout << x * y << endl << x << " " << y;
  return 0;
}
