#include <bits/stdc++.h>
using namespace std;
const int mod = 1000000007;
const int MAXN = 5005;
long long n, a, b;
void solve() {
  cin >> n >> a >> b;
  n *= 6;
  if (a * b >= n) {
    cout << a * b << endl << a << " " << b << endl;
    return;
  }
  while (true) {
    for (int i = a; i <= n / b && i <= (double)sqrt(double(n)) + 1; i++)
      if (n % i == 0) {
        cout << n << endl << i << " " << n / i << endl;
        return;
      }
    for (int i = b; i <= n / a && i <= (double)sqrt(double(n)) + 1; i++)
      if (n % i == 0) {
        cout << n << endl << n / i << " " << i << endl;
        return;
      }
    n++;
  }
}
int main() {
  solve();
  return 0;
}
