#include<iostream>
#include<vector>
#include<algorithm>
#include<stdlib.h>
#include<utility>
#include<functional>
#include<cfenv>
#include<cmath>
#include<string>
#include<queue>
#include<stack>
#include<map>
#include<set>

#define rep(i,n) for(int (i)=0;(i)<(n);(i)++)
#define vint vector<int>
#define vvint vector<vint>
#define P pair<ll ,ll>
#define INT_MAX 2147483647
#define MOD 1000000007
#define PI 3.14159265358979323846
#define all(a) (a).begin(),(a).end()
using namespace std;
typedef long long ll;

int main() {
	int n, k; cin >> n >> k;
	int nsum = 100 * n * (n + 1) / 2;
	int ksum = k * (k + 1) / 2;
	cout << nsum * k + ksum * n<<endl;

	return 0;
}
#include <bits/stdc++.h>
using namespace std;
 
#define pb push_back
#define pob pop_back
#define S second
#define F first
#define FAST ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0)
#define vll vector<long long int>
#define pll pair<long long int,long long int>
#define mod 1000000007
#define mod2 998244353
#define ll long long int
#define ld long double
#define pi 3.141592653589793238
#define Endl endl
#define endl "\n"
const int N = 2e5 + 15;
const ll inf = 1e18;

void solve()
{
        ll a , b;
        cin >> a >> b;
        ll ans = 0;
        for(ll i=1;i<=a;i++)
        {
                for(ll j=1;j<=b;j++)
                        ans += (i*100 + j);
        }
        cout << ans;
}         

void debug(ll tt) {}
 
signed main()
{
        FAST;
        int t = 1;
        // cin >> t;
        while(t--)
        {
                solve();
        }
}