#include <bits/stdc++.h>
using namespace std;
#define IOS ios_base::sync_with_stdio(false);   cin.tie(NULL); cout.tie(NULL);
#define endl "\n";
#define mod 1000000007
#define loop(i,s,n)  for(ll i=s;i<n;i++)
#define test  ll t; cin>>t; while(t--)
#define p push_back
#pragma GCC target ("avx2")
#pragma GCC optimization ("O3")
#pragma GCC optimization ("unroll-loops")
#pragma GCC optimize("Ofast")
#pragma GCC target("avx,avx2,fma")
typedef long long ll;
int main()
{int n,i,j,k,count=0,sum=1,f=0;
int a,b,c;
cin>>a>>b;

k=(a*(a+1))/2;
count+=(k*100)*b;
n=b*(b+1);
n=n/2;
count+=(n*a);
cout<<count;


  return 0;
}



#include<bits/stdc++.h>
#define ll long long int
#define IOS ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define mod 1000000007
#define N 100100
using namespace std;

ll power(ll x,ll y)
{
    ll res = 1;
    while(y)
    {
        if(y&1) res = (res*x)%mod;
        y=y/2;
        x=(x*x)%mod;
    }
    return res;
}



signed main()
{

    IOS;

    // ll t;
    // cin>>t;

    // while(t--)
    // {
    // }

    ll n,k;
    cin>>n>>k;

    cout<<((100*k*n*(n+1))/2)+((n*k*(k+1))/2)<<endl;




}