import java.io.PrintWriter;
import java.math.BigInteger;
import java.util.*;
;

 
public class Main
{
	 public static int indexOf(int[] a, int key) {
	        int lo = 0;
	        int hi = a.length - 1;
	        int last = -1;
	        while (lo <= hi) {
	            // Key is in a[lo..hi] or not present.
	            int mid = lo + (hi - lo) / 2;
	            if      (key < a[mid]) hi = mid - 1;
	            else if (key > a[mid]) lo = mid + 1;
	            
	            else return mid;
	            last = mid;
	        }
	        return last;
	    }

	
	public static void main(String [] args){
		Scanner scan = new Scanner (System.in);
		
		int [] score = {500, 1000, 1500, 2000, 2500};
		int [] m = new int [5];
		int [] w = new int [5];
		
		
		
		for(int i = 0; i < 5; i++){
			m[i] = scan.nextInt();
		}
		
		for(int i = 0; i < 5; i++){
			w[i] = scan.nextInt();
		}
		
		
		int hs = scan.nextInt();
		int hu = scan.nextInt();
		
		int suma = 0;
		for(int i = 0; i < 5; i++){
			suma += Math.max(0.3 * score[i], (1 - m[i]/250.0)*score[i] - 50*w[i]);
		}
		
		suma += hs * 100;
		suma -= hu * 50;
		
		System.out.println(suma);
	}
}
/*
 

*/