#include <bits/stdc++.h>
using namespace std;
void solve() {
  long long n, a, b;
  cin >> n >> a >> b;
  n *= 6;
  if (a * b >= n) {
    cout << a * b << endl << a << " " << b;
    return;
  }
  bool sw = a > b;
  if (sw) swap(a, b);
  long long m = (long long)1e18;
  long long a1, b1;
  long long ob = b;
  for (; a * a <= n; a++) {
    b = (n + a - 1) / a;
    b = max(b, ob);
    if (a * b < m) {
      m = a * b;
      a1 = a;
      b1 = b;
    }
  }
  if (sw) swap(a1, b1);
  cout << m << endl << a1 << " " << b1;
}
int main() { solve(); }
