#include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include using namespace std; typedef long long ll; typedef pair P; long long int INF = 3e18; double Pi = 3.1415926535897932384626; vector G[500005]; //vector

tree[500010]; priority_queue pql; priority_queue

pqp; //big priority queue priority_queue ,greater > pqls; priority_queue ,greater

> pqps; //small priority queue //top pop int dx[8]={1,0,-1,0,1,1,-1,-1}; int dy[8]={0,1,0,-1,1,-1,-1,1}; char dir[] = "DRUL"; //ll bit[500005]; //↓,→,↑,← #define p(x) cout< number2){ swap(number1,number2); } if(number1 == 0 || number1 == number2){ return number2; }else{ return gcd(number2 % number1,number1); } } void YES(bool condition){ if(condition){ p("YES"); }else{ p("NO"); } return; } void Yes(bool condition){ if(condition){ p("Yes"); }else{ p("No"); } return; } //ll fact[800005],rfact[800005]; /* void c3_init(){ fact[0] = rfact[0] = 1; for(ll i=1; i<=800000; i++){ fact[i] = (fact[i-1]*i) % mod; } rfact[800000] = rui(fact[800000],mod - 2); for(ll i=800000; i>=1; i--){ rfact[i-1] = rfact[i] * i; rfact[i-1] %= mod; } return;} ll c3(ll n,ll r){ return (((fact[n] * rfact[r]) % mod) * rfact[n-r]) % mod;} */ ll n,m,num,sum,ans,a,b,c,d,e,g,h,w,i,j,k,q; ll x[300005],y[300005],z[300005]; char s[500005],t[500005]; bool isok; int main(){ cin >> h >> w; if(w < 0)w *= -1; ll add = 1; while(1){ if(a + add <= w - 1){ a += add; ans += add * add; }else{ ans += (w - 1 - a) * add; break; } if(add < h){ add++; } //pe(a);p(ans); } ans += h; p(ans); return 0; }