#include <bits/stdc++.h>

using namespace std ;

const int MAX = 1e5 + 10 ;

int arr[MAX] ;
int n , k ;

int main()
{
	ios_base::sync_with_stdio(0) ;
	cin.tie(0) ;
	cin>>n>>k ;
	long long a = n * (n + 1ll) / 2ll ;
	long long b = k * (k + 1ll) / 2ll ;
	return cout<<100ll * a * k + b * n<<"\n" , 0 ;
}		
#include <bits/stdc++.h>
using namespace std;

using ll = long long;
using ull = unsigned long long;
using ld = long double;

#define          pb                push_back
#define          eb                emplace_back
#define          all(x)            x.begin(), x.end()
#define          sz(x)             int(x.size())
#define          pii               pair<int, int>
#define          pll               pair<ll, ll>
#define          ff                first
#define          ss                second

const ll INF = 1e18;
const int MOD = 1e9+7;
const int N = 2e5+7;
const double PI = 3.1415926535897932384626;

void solve() {
    int n, k; cin >> n >> k;
    int sum = 0;
    for (int i = 1; i <= n; ++i) {
        for (int j = 1; j <= k; ++j) sum += i*100+j;
    }
    cout << sum;
}

void fastIO(string name = "") {
    cin.tie(0)->sync_with_stdio(0);
    if (sz(name)) {
        freopen((name + ".in").c_str(), "r", stdin);
        freopen((name + ".out").c_str(), "w", stdout);
    }
}

int main() {
    fastIO("");

    int tc = 1; //cin >> tc;
    while (tc--) solve();
    return 0;
}