#include <cstdio>
#include <algorithm>
using namespace std;
int main( )
{
int m, b;
scanf ( "%d %d" , & m, & b) ;
long long ans = max( ( 1 + b) * b / 2 , ( 1 + b * m) * b * m / 2 ;
for ( int i = 1 ; i < b; i++ )
{
long long cur_ans = 0 ;
int cur_x = - 1 * ( i - b) * m;
if ( cur_x == 0 )
{
continue ;
}
for ( int x = 0 ; x <= cur_x; x++ )
{
cur_ans + = ( 1 + i) * i / 2 + x * i;
}
ans = max( ans, cur_ans) ;
}
printf ( "%lld" , ans) ;
}
I2luY2x1ZGUgPGNzdGRpbz4KI2luY2x1ZGUgPGFsZ29yaXRobT4KCgp1c2luZyBuYW1lc3BhY2Ugc3RkOwoKaW50IG1haW4oKQp7CglpbnQgbSwgYjsKCXNjYW5mKCIlZCAlZCIsICZtLCAmYik7Cglsb25nIGxvbmcgYW5zID0gbWF4KCgxICsgYikgKiBiIC8gMiwgKDEgKyBiICogbSkgKiBiICogbSAvIDI7Cglmb3IgKGludCBpID0gMTsgaSA8IGI7IGkrKykKCXsKCQlsb25nIGxvbmcgY3VyX2FucyA9IDA7CgkJaW50IGN1cl94ID0gLTEgKiAoaSAtIGIpICogbTsKCQlpZiAoY3VyX3ggPT0gMCkKCQl7CgkJCWNvbnRpbnVlOwoJCX0KCQlmb3IgKGludCB4ID0gMDsgeCA8PSBjdXJfeDsgeCsrKQoJCXsKCQkJY3VyX2FucyArPSAoMSArIGkpICogaSAvIDIgKyB4ICogaTsKCQl9CgkJYW5zID0gbWF4KGFucywgY3VyX2Fucyk7Cgl9CglwcmludGYoIiVsbGQiLCBhbnMpOwp9