#include <bits/stdc++.h>
using namespace std;
set<unsigned long long> q;
int main(int argc, char* argv[]) {
  unsigned long long n, a, b;
  cin >> n >> a >> b;
  unsigned long long ca = a, cb = b, cs = ca * cb, cn = n * 6;
  if (cs < cn) {
    unsigned long long v = 1;
    while (v * v < cn) {
      if ((cn % v) == 0) {
        q.insert(v);
        q.insert(cn / v);
      }
      ++v;
    }
    if (v * v == cn) q.insert(v);
    ca = *q.lower_bound(a);
    cb = cn / ca;
    if (cb < b) {
      cb = *q.lower_bound(b);
      ca = cn / cb;
      if (ca < a) {
        unsigned long long qcs = -1, e = (cn + b - 1) / b;
        for (unsigned long long ia = a; ia <= e; ++ia) {
          unsigned long long ib = cn / ia, ccs = ia * ib;
          while (ccs < cn) {
            ++ib;
            ccs += ia;
          }
          if (ib < b) break;
          if (ccs < qcs) {
            qcs = ccs;
            ca = ia;
            cb = ib;
            if (ccs - cn == 1) break;
          }
        }
      }
    }
    cs = ca * cb;
  }
  cout << cs << endl << ca << ' ' << cb << endl;
  return 0;
}
