#include <bits/stdc++.h>
void solve(long long int n) {
  int i, j, k;
  long long int a, b, q, s, aa, bb;
  scanf("%I64d%I64d", &a, &b);
  n *= 6;
  if (a * b >= n) {
    printf("%I64d\n%I64d %I64d\n", a * b, a, b);
    return;
  }
  j = 0;
  if (b > a) {
    q = b;
    b = a;
    a = q;
    j = 1;
  }
  k = (int)sqrt(1.0 * n) + 1;
  i = (int)b;
  q = (n + i - 1) / i;
  s = q * i;
  bb = i;
  aa = q;
  for (i = (int)b; i <= k; i++) {
    q = (n + i - 1) / i;
    if (q < a) q = a;
    if (q * i < s) {
      s = q * i;
      bb = i;
      aa = q;
    }
  }
  if (j == 0) {
    printf("%I64d\n%I64d %I64d\n", s, aa, bb);
  } else {
    printf("%I64d\n%I64d %I64d\n", s, bb, aa);
  }
}
int main() {
#pragma comment(linker, "/STACK:67108864")
  int n, m;
  while (scanf("%d", &n) != EOF) {
    solve(n);
  }
  return 0;
}
