#include <bits/stdc++.h>
using namespace std;
const long long OO = 1e8;
const double EPS = (1e-7);
int dcmp(double x, double y) { return fabs(x - y) <= EPS ? 0 : x < y ? -1 : 1; }
const int N = 100;
vector<int> prime;
bool mat[1000001] = {0};
void generate_primes(int n) {
  prime.clear();
  prime.push_back(2);
  for (int i = 3; i * i <= n; i += 2) {
    if (mat[i] == 0) {
      for (int j = i * i; j < n; j += 2 * i) mat[j] = 1;
    }
  }
  for (int i = 3; i <= n; i += 2)
    if (!mat[i]) prime.push_back(i);
}
unsigned long long gcd(unsigned long long a, unsigned long long b) {
  for (;;) {
    if (a == 0) return b;
    b %= a;
    if (b == 0) return a;
    a %= b;
  }
}
unsigned long long lcm(unsigned long long a, unsigned long long b) {
  unsigned long long temp = gcd(a, b);
  return temp ? (a / temp * b) : 0;
}
long long power(long long a, long long b) {
  long long ans = 1;
  for (int i = 0; i < (int)(b); ++i) ans *= a;
  return ans;
}
bool isNum(char c) { return isdigit(c); }
int main() {
  ios::sync_with_stdio(false);
  vector<int> m(5), w(5);
  int score = 0;
  vector<int> top(5);
  top[0] = 500;
  top[1] = 1000;
  top[2] = 1500;
  top[3] = 2000;
  top[4] = 2500;
  for (int i = 0; i < (int)(5); ++i) {
    cin >> m[i];
  }
  for (int i = 0; i < (int)(5); ++i) {
    cin >> w[i];
  }
  int hs, hu;
  cin >> hs >> hu;
  hs = 100 * hs;
  hu = 50 * hu;
  int mm;
  vector<int> mini(5);
  mini[0] = 150;
  mini[1] = 300;
  mini[2] = 450;
  mini[3] = 600;
  mini[4] = 750;
  for (int i = 0; i < (int)(5); ++i) {
    score += max(mini[i], ((250 - m[i]) * ((i + 1) * 2)) - 50 * w[i]);
  }
  score += hs;
  score -= hu;
  cout << score;
  return 0;
}
