#include <bits/stdc++.h>
using namespace std;
pair<long long, long long> searchAns(long long n, long long a, long long b) {
  long long minDiff = 1000000000;
  long long x, y;
  x = y = -1;
  for (long long i = 0; i < 100000; i++) {
    long long l = i;
    long long r = 1000000000;
    while (l <= r) {
      long long mid = l + (r - l) / 2;
      long long diff = (a + i) * (b + mid) - n;
      if (diff >= 0) {
        if (minDiff > diff) {
          minDiff = diff;
          x = i;
          y = mid;
        }
        r = mid - 1;
      } else {
        l = mid + 1;
      }
    }
  }
  for (long long i = 0; i < 100000; i++) {
    long long l = i;
    long long r = 1000000000;
    while (l <= r) {
      long long mid = l + (r - l) / 2;
      long long diff = (a + mid) * (b + i) - n;
      if (diff >= 0) {
        if (minDiff > diff) {
          minDiff = diff;
          x = mid;
          y = i;
        }
        r = mid - 1;
      } else {
        l = mid + 1;
      }
    }
  }
  return make_pair(a + x, b + y);
}
int main() {
  ios_base::sync_with_stdio(false);
  long long n, a, b;
  cin >> n >> a >> b;
  if (a * b >= 6 * n) {
    cout << a * b << endl;
    cout << a << " " << b;
    return 0;
  }
  pair<long long, long long> finalPair = searchAns(6 * n, a, b);
  cout << finalPair.first * finalPair.second << endl;
  cout << finalPair.first << " " << finalPair.second;
  return 0;
}
