#include <bits/stdc++.h>
using namespace std;
const double error = 1e-15;
const double pi = 2 * acos(0);
const int maxn = (int)1e5 + 10;
const int mod = (int)1e9;
int main() {
  long long n, a, b, x, sm, a1, b1, flg = 1;
  cin >> n >> a >> b;
  sm = 6 * n;
  if (a * b >= sm) {
    cout << a * b << endl;
    cout << a << " " << b << endl;
    return 0;
  }
  if (a > b) {
    swap(a, b);
    flg = 0;
  }
  b1 = sm / a;
  if (sm % a > 0) b1++;
  a1 = a;
  while (a <= sqrt(sm)) {
    x = sm / a;
    if (sm % a > 0) x++;
    if (x < b) {
      break;
    }
    if (a * x < a1 * b1) {
      a1 = a;
      b1 = x;
    }
    if (a1 * b1 == sm) {
      break;
    }
    a++;
  }
  cout << a1 * b1 << endl;
  if (flg == 1)
    cout << a1 << " " << b1 << endl;
  else
    cout << b1 << " " << a1 << endl;
  return 0;
}
