#include <bits/stdc++.h>
using namespace std;
template <typename T1, typename T2>
istream& operator>>(istream& in, pair<T1, T2>& a) {
  in >> a.first >> a.second;
  return in;
}
template <typename T1, typename T2>
ostream& operator<<(ostream& out, pair<T1, T2> a) {
  out << a.first << " " << a.second;
  return out;
}
template <typename T, typename T1>
T amax(T& a, T1 b) {
  if (b > a) a = b;
  return a;
}
template <typename T, typename T1>
T amin(T& a, T1 b) {
  if (b < a) a = b;
  return a;
}
const long long INF = 1e18;
const int32_t M = 1e9 + 7;
const int32_t MM = 998244353;
const long long N = 0;
void solve(long long test) {
  long long n, a, b;
  cin >> n >> a >> b;
  if (6 * n <= (a * b)) {
    cout << a * b << endl << a << " " << b << endl;
  } else {
    bool f = 0;
    if (a > b) {
      swap(a, b);
      f = 1;
    }
    long long SQ = 1e18, a1, b1, tmpb;
    for (long long i = a; i * i <= 6 * n; ++i) {
      tmpb = 6 * n / i;
      if (tmpb * i < 6 * n) tmpb++;
      if (tmpb < b) continue;
      if (tmpb * i < SQ) {
        SQ = tmpb * i;
        a1 = i;
        b1 = tmpb;
      }
    }
    if (f) swap(a1, b1);
    cout << SQ << "\n" << a1 << " " << b1 << "\n";
  }
}
signed main() {
  long long t = 1;
  while (t--) {
    solve(t);
  }
}
