821B - Okabe and Banana Trees - CodeForces Solution

// [ ﷽ ] Bismillahir Rahmanir Raheem//
#include<bits/stdc++.h>
#include<iostream>
#define ff first
#define ss second 
#define pb push_back
#define int long long
#define noob ios::sync_with_stdio(0);cin.tie(0);
using namespace std;
void solve2(){
  int m,b;
  cin>>m>>b;
  int ans=0;
  for(int i=b;i>=0;i--){
    int j=b*m-m*i;
    int ct=(i*(i+1)/2)*(j+1)+(j*(j+1)/2)*(i+1);
    ans=max(ans,ct);
  }
  cout<<ans<<endl;
}
void solve(){
 int x,y;
 for(int i=1;i<=5;i++){
  for(int j=1;j<=5;j++){
    int z;
    cin>>z;
    if(z==1){
      x=i,y=j;
    }
  }
 }
 cout<<abs(3-x)+abs(3-y)<<endl;
}
void solve3(){
  double x;
  int a;
  int n;
  cin>>n>>a;
  int r,s,t;
  double y=1.0*a;
  x=1.0*(n-2)*180/n;
 int k=n-3;
 double f=abs(x-y);
 r=1,s=2,t=3;
 int m=n;
 //cout<<x<<" "<<f<<" ";
 double p=(x/(1.0*(k+1)));
 for(int i=1;i<=k;i++){
 double d=p*(1.0)*i;
//  cout<<d<<" "<<abs(d-y)<<" "<<f<<endl;
  if(abs(d-y)<f){
    t=m; 
    f=abs(d-y);
  }
   m--;
 }
 cout<<r<<" "<<s<<" "<<t<<endl;
 
}
signed main(){
    noob
  int t=1;
 // cin>>t;
  while(t--){
    solve2();
  }
   return 0;
}