#include <bits/stdc++.h>
using namespace std;
const long long mod1 = static_cast<long long>(1073741824);
const long long mod2 = static_cast<long long>(1000000007);
const long long INF = 1ll * 1000 * 1000 * 1000 * 1000 * 1000 * 1000 + 7;
const long double pdiv = 1.0;
long long gcd(long long a, long long b) {
  if (!b) return a;
  return gcd(b, a % b);
}
long long lcm(long long a, long long b) { return (a * b) / gcd(a, b); }
long long power(long long x, long long y, long long p) {
  long long res = 1;
  x %= p;
  while (y > 0) {
    if (y & 1) res = (res * x) % p;
    y = y >> 1;
    x = (x * x) % p;
  }
  return res;
}
long long exp(long long x, long long n) {
  if (n == 0)
    return 1;
  else if (n & 1)
    return x * exp(x * x, (n - 1) / 2);
  else
    return exp(x * x, n / 2);
}
bool check_prime(long long n) {
  for (long long i = 0; i * i <= n; i++) {
    if (n % i == 0) return false;
  }
  return true;
}
vector<long long> SieveOfEratosthenes(long long n) {
  vector<bool> prime(n + 1, true);
  for (long long p = 2; p * p <= n; p++) {
    if (prime[p]) {
      for (long long i = p * p; i <= n; i += p) prime[i] = false;
    }
  }
  vector<long long> v;
  for (long long i = 2; i <= n; i++) {
    if (prime[i]) v.push_back(i);
  }
  return v;
}
signed main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  vector<long long> m(5, 0);
  vector<long long> w(5, 0);
  for (long long i = 0; i < 5; i++) cin >> m[i];
  for (long long i = 0; i < 5; i++) cin >> w[i];
  long long hs, hu;
  cin >> hs >> hu;
  long double score = 0;
  for (long long i = 0; i < 5; i++) {
    score += max(pdiv * 0.3 * 500 * (i + 1),
                 (1 - pdiv * m[i] / 250) * 500 * (i + 1) - 50 * w[i]);
  }
  score += hs * 100 - hu * 50;
  cout << fixed << setprecision(0) << score;
  return 0;
}
