#include <bits/stdc++.h>
using namespace std;
int gcd(int a, int b) {
  while (a && b) a > b ? a %= b : b %= a;
  return a + b;
}
long long lcm(long long a, long long b) { return (a * b) / gcd(a, b); }
long long fast_exp(long long base, long long exp) {
  long long res = 1;
  while (exp > 0) {
    if (exp % 2 == 1)
      res = ((res % 1000000007) * (base % 1000000007)) % 1000000007;
    base = ((base % 1000000007) * (base % 1000000007)) % 1000000007;
    exp /= 2;
  }
  return res % 1000000007;
}
const int INF = INT_MAX;
const long long INFL = LLONG_MAX;
int main() {
  std::ios::sync_with_stdio(0);
  cin.tie(0);
  long double m[5], w[5], x[5], h[2];
  for (int(i) = 0; (i) < (5); (i)++) {
    x[i] = 500.0 * (i + 1);
    cin >> m[i];
  }
  for (int(i) = 0; (i) < (5); (i)++) cin >> w[i];
  cin >> h[0] >> h[1];
  double sum = 0;
  for (int(i) = 0; (i) < (5); (i)++) {
    sum += max(0.3 * x[i], (1.0 - (m[i] / 250.0)) * x[i] - 50.0 * w[i]);
  }
  sum += h[0] * 100.0;
  sum -= h[1] * 50.0;
  long long ans = sum;
  cout << ans << '\n';
  return 0;
}
