#include<iostream>

#include<cstdio>

#include<cstdlib>

#include<cstring>

#include<cmath>

#include<map>

#include<set>

#include<vector>

#include<algorithm>

#include<stack>

#include<queue>

#include<cctype>

#include<sstream>

using namespace std;

#define INF 1000000000

#define eps 1e-8

#define pii pair<int,int>

#define LL long long int

LL a,b,n,s,a1,b1,t;

int main()

{

    //freopen("in8.txt","r",stdin);

    //freopen("out.txt","w",stdout);

    scanf("%I64d%I64d%I64d",&n,&a,&b);

    s=;

    t=ceil(sqrt(*n));

    LL sum=*n;

    if(n*<=a*b)

        cout<<a*b<<endl<<a<<' '<<b<<endl;

    else

    {

        bool c=;

        if(a>b)

        {

            c=;

            swap(a,b);

        }

        for(LL i=a;i<=t;i++)

        {

            LL t=max(b,sum/i+(sum%i!=));

            if(i*t<s)

            {

                a1=i,b1=t,s=i*t;

            }

        }

        if(c)

            cout<<s<<endl<<b1<<' '<<a1<<endl;

        else

            cout<<s<<endl<<a1<<' '<<b1<<endl;

    }

    //fclose(stdin);

    //fclose(stdout);

    return ;

}