#include <bits/stdc++.h>
using namespace std;
long long n, a, b;
bool cmp(pair<long long, long long> a, pair<long long, long long> b) {
  return a.first * a.second < b.first * b.second;
}
void add(vector<pair<long long, long long> > &ans, long long ca, long long cb) {
  if (ca >= a && cb >= b && ca * cb >= n)
    ans.push_back(pair<long long, long long>(ca, cb));
  swap(ca, cb);
  if (ca >= a && cb >= b && ca * cb >= n)
    ans.push_back(pair<long long, long long>(ca, cb));
}
int main() {
  cin >> n >> a >> b;
  if (a * b >= 6 * n) {
    cout << a * b << endl;
    cout << a << " " << b << endl;
  } else {
    vector<pair<long long, long long> > ans;
    n *= 6;
    long long ca, cb;
    for (long long i = a; i <= a + 100; i++) {
      ca = i;
      cb = n / i;
      if (ca * cb < n) cb++;
      add(ans, ca, cb);
    }
    for (long long i = b; i <= b + 100; i++) {
      cb = i;
      ca = n / i;
      if (ca * cb < n) ca++;
      add(ans, ca, cb);
    }
    for (long long i = 2; i * i <= n; i++) {
      ca = i;
      cb = n / i;
      if (ca * cb < n) cb++;
      add(ans, ca, cb);
    }
    sort(ans.begin(), ans.end(), cmp);
    ca = ans.begin()->first;
    cb = ans.begin()->second;
    cout << ca * cb << endl;
    cout << ca << " " << cb << endl;
  }
}
