#include<bits/stdc++.h>
using namespace std;

int n,p,q;
long long ans;

long long m(int x){
	long long tra=(n-x)/(x+1);
	long long extra=(n-x)%(x+1);
	return p*(extra*(tra+1)*(tra+1)+(x+1-extra)*tra*tra)+q*x;
}

int main(){
	freopen("money.in","r",stdin);
	freopen("money.out","w",stdout);
	
	cin>>n>>p>>q;
	
	ans=(long long)p*n*n;
	for(int i=1;i<=n;++i){
		ans=min(ans,m(i));
	}
	cout<<ans;
}