#include <cstdio>
#include <algorithm>
typedef long long ll;

ll n, travelCost, eatCost;
ll ans = 0x7fffffffffffffff;

int main() {
  #ifdef LOCAL
    freopen("!input.in", "r", stdin);
    freopen("!output.out", "w", stdout);
  #else
    freopen("money.in", "r", stdin);
    freopen("money.out", "w", stdout);
  #endif

  scanf("%lld %lld %lld", &n, &travelCost, &eatCost);

  for (ll travel = 0; travel <= n; ++travel) {
    ll eat = n - travel;
    if (eat >= travel - 1) {
      ans = std::min(ans, travel * travelCost + eat * eatCost);
    } else {
      ll sep = eat + 1;
      ll single = travel / sep;
      ll last = travel % sep;
      if (last) {
        ans = std::min(ans, single * single * travelCost * (sep - 1) + (single + last) * (single + last) * travelCost + eat * eatCost);
      } else {
        ans = std::min(ans, single * single * travelCost * sep + eat * eatCost);
      }
    }
  }

  printf("%lld\n", ans);
  return 0;
}