#define _CRT_SECURE_NO_WARNINGS
#include <initializer_list>
#include <iostream>
#include <stdio.h>
#include <stdlib.h>
#include <string>
#include <string.h>
#include <map>
#include <set>
#include <vector>
#include <algorithm>
#include <random>
#include <queue>
#include <deque>
#include <time.h>
#include <limits.h>
#define rep(unt) for (int i = 0; i < unt; ++i)
#define each(var, st) for (auto var : st)
#define all(x) (x).begin(), (x).end()
#define mp(a, b) make_pair((a), (b))
#define pii pair<int, int>
#define pb push_back
#define ins insert
#define db double
#define ldb long double
#define pll pair<long long, long long>
#define ci const int
#define ll long long
#define INF 1000000007
#define LLINF 1000000000000000007
#define rt return
using namespace std;

mt19937 rng(time(0));
uniform_int_distribution<int> uid(-INF, INF);
#define int long long
struct v3 {
    int x=0,y=0,z=0;
    v3(int x, int y, int z): x(x), y(y), z(z) {}
};

void solve(bool debug=false) {

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

}

template <size_t SZ, class T>inline void clear1dArray(T(&st)[SZ],T fillValue)
{rep(SZ)st[i]=fillValue;}
template<size_t SZn,size_t SZm,class T>inline void clear2dArray(T(&st)[SZn][SZm],T fillValue)
{rep(SZn)for(int j=0;j<SZm;++j)st[i][j]=fillValue;}
void clear() {
}
signed main(signed argc,char* argv[]) {
    if (argc==2&&strcmp(argv[1],"__DEBUG__")==0){
        int t=0;cin>>t;
        string ph;
        getline(cin, ph);
        for(int i=1; i<=t;++i){
            cout << "Case #" << i << ":" << "\n";
            solve(true);
            cout << "\n";
            clear();
        }
    }
    else solve();
    return 0;
}
#include <iostream>
using namespace std;
int main(void){
    // Your code here!
    int N,M;
    cin >> N >> M;
    
    int sum = 0;
    for(int i = 1; i <= N; i++){
        for(int j = 1; j <= M; j++){
            sum += i*100 + j;
        }
    }
    
    cout << sum << endl;
}
