#include <cstdio>
#include <cmath>
#include <iostream>
#include <iomanip>
#include <string>
#include <algorithm>
#include <vector>
#include <set>
#include <map>
#include <queue>
#include <deque>
#include <stack>
#include <tuple>
#include <bitset>
#include <complex>
using namespace std;

//typedef long long ll;
//typedef pair<ll, ll> P;
//const ll INF   = 1000000000000000000;
//const ll MOD   = 1000000000 + 7;

//typedef pair<int, int> P;
//const int INF  = 1000000001;
//const int MOD  = 1000000000 + 7;

//const int MAX_N = 100000 + 10;
//int a[MAX_N];

int main() {
  cin.tie(nullptr);
  ios::sync_with_stdio(false);

  int N, K;
  cin >> N >> K;

  int ans = 0;
  for(int n = 1; n <= N; n++) {
    for (int k = 1; k <= K; k++) {
      int tmp = 100*n + k;
      ans += tmp;
    }
  }

  cout << ans << endl;
  
  return 0;
}





#include<iostream>
using namespace std;
int main()
{
  int A,B=0;
  int maxFollow=0;
  
  cin >> A;
  cin >> B;
  
  maxFollow = 2*A + 100;
  
  int diff = maxFollow - B;
  
  cout << diff << endl;
}