#include <bits/stdc++.h>
using namespace std;
double PI = 3.141592653589793;
void solve() {
  long long n, a, b;
  cin >> n >> a >> b;
  n *= 6;
  vector<pair<long long, long long> > proc;
  proc.push_back({n, n});
  for (long long i = n - 1; i > 0;) {
    long long k = (n + i - 1) / i;
    long long lo = (n + k - 1) / k;
    proc.push_back({lo, i});
    i = lo - 1;
  }
  if (a * b >= n) {
    cout << a * b << '\n' << a << ' ' << b;
    return;
  }
  long long mn = LLONG_MAX;
  pair<long long, long long> out;
  for (auto i : proc) {
    long long lo = i.first, hi = i.second, k = (n + lo - 1) / i.first;
    if (k < b) continue;
    if (hi < a) continue;
    lo = max(lo, a);
    if (mn > lo * k) {
      mn = lo * k;
      out = {lo, k};
    }
  }
  swap(a, b);
  for (auto i : proc) {
    long long lo = i.first, hi = i.second, k = (n + lo - 1) / i.first;
    if (k < b) continue;
    if (hi < a) continue;
    lo = max(lo, a);
    if (mn > lo * k) {
      mn = lo * k;
      out = {k, lo};
    }
  }
  cout << mn << '\n';
  cout << out.first << ' ' << out.second;
}
int main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  int T = 1;
  for (int c = 0; c < T; c++) {
    solve();
  }
}
