#include <cstdio>
#include <cstring>
#include <iostream>
#include <string>
#include <cmath>
#include <bitset>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <deque>
#include <algorithm>
#include <complex>
#include <unordered_map>
#include <unordered_set>
#include <random>
#include <cassert>
#include <fstream>
#define popcount __builtin_popcount
using namespace std;
typedef long long int ll;
typedef pair<ll, ll> P;

int main()
{
    ll h, w; cin>>h>>w;
    if(h==0 || w==0){
        cout<<0<<endl;
        return 0;
    }
    w=abs(w);
    ll ans=h*w;
    for(ll k=(w+h-1)/h; k<=(w+h-1)/h+1000000; k++){
        ll x=w/k;
        ll s=((x+1)*(x+1)*(w%k)+x*x+(k-w%k)-w)/2+h*k;
        ans=min(ans, s);
    }
    cout<<ans<<endl;
    return 0;
}