#include <bits/stdc++.h>
#pragma comment(linker, "/Stack:256000000")
using namespace std;
const int INF = (int)1e9;
const double EPS = 1e-9;
int solve();
int gen();
int main() {
  solve();
  return 0;
}
int check(long long s, const vector<int> &a) {
  multiset<long long> st;
  for (int i = 0; i < a.size(); ++i) st.insert(a[i]);
  int ans = 0;
  while (!st.empty()) {
    ++ans;
    long long d = s - *st.begin();
    st.erase(st.begin());
    if (st.empty()) break;
    auto it = st.upper_bound(d);
    if (it == st.begin()) continue;
    --it;
    st.erase(it);
  }
  return ans;
}
int solve() {
  cin.tie(0);
  cin.sync_with_stdio(0);
  int m[5], w[5], h1, h2;
  for (int i = 0; i < 5; ++i) cin >> m[i];
  for (int i = 0; i < 5; ++i) cin >> w[i];
  cin >> h1 >> h2;
  double ans = 0;
  double b[5] = {500, 1000, 1500, 2000, 2500};
  for (int i = 0; i < 5; ++i) {
    ans += max((b[i] * 0.3), (b[i] * (250.0 - m[i]) / 250.0) - 50 * w[i]);
  }
  ans += 100 * h1;
  ans -= 50 * h2;
  cout << (int)(ans + 0.0001);
  return 0;
}
