#include <bits/stdc++.h>

using namespace std;
#define IOS ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define endl "\n"
#define int long long



// const int md = 998244353;
const int sz = 1e5+1;

int A[sz+1];
int B[sz+1];
// int C[sz+1];


vector<int> primes;

void sieve(){
    primes.clear();
    for (int i = 0; i <= sz; ++i)
    {
        A[i] = 1;
    }

    for (int i = 2; i <= sz; ++i)
    {
        if(A[i]){
            for (int j = i*i; j <= sz ; j += i)
            {
                A[j] = 0;
            }
        }
    }

    for (int i = 2; i <= sz; ++i)
    {
        if(A[i])
            primes.push_back(i);
    }


}


void solve(){
    int a,b;cin>>b>>a;
    b = 2*(b) + 100;
    cout<<b-a<<endl;
return;
}


int32_t main()
{
    IOS;
    // sieve();
    // int t;cin >> t;
    // while (t--) 
        solve();
    return 0;
}





/**In the name of Allah, the Most Merciful, the Most Merciful.**/
#pragma GCC diagnostic ignored "-Wunused-variable"
#pragma GCC diagnostic ignored "-Wunused-parameter"
#pragma GCC diagnostic ignored "-Wunused-but-set-variable" 
#pragma GCC diagnostic ignored "-Wformat"
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
typedef long long ll;
typedef unsigned long long ull;
#define INF 9223372036854775806
#define pb push_back
#define mp make_pair
#define MOD 1000000007
#define PI 2*acos(0.0)
#define EPS 1e-9
#define base 313
#define base1 431
#define MOD1 999987337
#define maxm 200005
#define maxn 200005

template<class T> using oset=tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
//order_of_key,find_by_order
ll max(ll a,ll b) {if(a>b) return a; else return b;} ll min(ll a,ll b) {if(a<b) return a; else return b;}
void FastIO(){
	ios_base :: sync_with_stdio (false);
  	cin.tie(0);
	cout.precision(20);
}


int main()
{
	//what the hell are youing? Think again before coding.
	FastIO();
	
	int a,b;
	cin>>a>>b;
	
	ll sum=0;
	
	for(int i=1;i<=a;i++){
		for(int j=1;j<=b;j++){
			sum=sum+(i*100+j);
		}
	}
	
	cout<<sum<<endl;
	

    return 0;
    //you should actually read the stuff at the bottom
}
/* stuff you should look for
	* int overflow, array bounds
	* special cases (n=1?)
	* do smooth instead of nothing and stay organized
	* don't get stuck on one approach, try another
	* don't waste time in one problem, try another
	* check PI value acos(-1.0)
*/