#include <bits/stdc++.h>
using namespace std;
const double PI = 2 * acos(0.0);
const int Mod = 1E9 + 7;
inline void yes() { std::cout << "Yes\n"; }
inline void no() { std::cout << "No\n"; }
using namespace std;
long long int isPrime(long long int num) {
  long long int flag = 0;
  for (long long int i = 1; i <= num; i++) {
    if (num % i == 0) {
      flag++;
      if (flag > 3) break;
    }
  }
  if (flag == 3)
    return 1;
  else
    return 0;
}
long long int binomialCoeff(long long int n, long long int k) {
  long long int C[k + 1];
  memset(C, 0, sizeof(C));
  C[0] = 1;
  for (long long int i = 1; i <= n; i++) {
    for (long long int j = min(i, k); j > 0; j--) C[j] = C[j] + C[j - 1];
  }
  return C[k];
}
long long int factorial(long long int n) {
  if (n == 0) return 1;
  return n * factorial(n - 1);
}
bool isPalindrome(string str) {
  int l = 0;
  int h = str.length() - 1;
  while (h > l) {
    if (str[l++] != str[h--]) {
      return false;
    }
  }
  return true;
}
bool check(long long int n) {
  double y = sqrt(n);
  if (y - floor(y) == 0)
    return 1;
  else
    return 0;
}
bool isprime(long long int N) {
  if (N < 2 || (!(N & 1) && N != 2)) return 0;
  for (int i = 3; i * i <= N; i += 2) {
    if (!(N % i)) return 0;
  }
  return 1;
}
int main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  long long int x, y, cnt = 0, l, o, t, n, sum = 0, lasum = 0, ans = 0, las = 0,
                      flag = 0, ma = LLONG_MAX, av1, av2, sum1 = 0, sum2 = 0;
  double a1[] = {500, 1000, 1500, 2000, 2500};
  double a, b, c, d, e, f;
  double sc[5];
  for (long long int i = (0); i < (5); i++) cin >> sc[i];
  double w[5];
  for (long long int i = (0); i < (5); i++) cin >> w[i];
  cin >> av1 >> av2;
  t = 0;
  for (long long int i = (0); i < (5); i++) {
    t = t + max(0.3 * a1[i], (1 - (sc[i] / 250)) * a1[i] - 50 * w[i]);
  }
  cout << t + 100 * av1 - 50 * av2 << '\n';
}
