#include <bits/stdc++.h>
using namespace std;
const int mod = 1000000007;
const int maxn = 100005;
long long mm(int n, int m) {
  long long s = 1;
  long long k = n;
  while (m) {
    if (m & 1) {
      s = s * k;
      s %= mod;
    }
    k = k * k;
    k %= mod;
  }
  return s;
}
int m[5];
int main() {
  int i, j, n;
  int s = 0;
  for (i = 0; i < 5; i++) {
    scanf("%d", &m[i]);
  }
  for (i = 0; i < 5; i++) {
    int p;
    scanf("%d", &p);
    s += max(150 * (i + 1), (500 - 2 * m[i]) * (i + 1) - 50 * p);
  }
  int a, b;
  scanf("%d%d", &a, &b);
  s += 100 * a - 50 * b;
  printf("%d\n", s);
}
