import static java.lang.Math.max;
import java.util.Scanner;

/**
 *
 * @author user
 */
public class AUncowedForces {

    /**
     * @param args the command line arguments
     */
    public static void main(String[] args) {
        
        Scanner in = new Scanner(System.in) ;
        
        int [] array = new int[5] ;
        array[0] = 500 ;
        array[1] = 1000 ;
        array[2] = 1500 ;
        array[3] = 2000 ;
        array[4] = 2500 ;
        
        int []minetes = new int [5] ;
        for(int i=0; i<5 ; i++)
            minetes[i] = in.nextInt() ;
        
        int sum = 0 ;
        int []wrong = new int[5] ;
        for(int i=0; i<5 ; i++)
        {
            wrong[i] = in.nextInt() ;
           
            double n1 = (0.3*array[i]) ;
            double e = minetes[i]/250.0 ;
            double n2 = (1-e)*array[i] - 50*wrong[i] ;
            
            sum+= max( n1 ,n2 ) ;
            
        }
        
        int suc_h = in.nextInt() ;
        int un_suc_h = in.nextInt() ;
        
        sum+= suc_h*100  ;
        sum-= un_suc_h*50 ;
        System.out.println(sum);
    }
    
}
