import java.util.Scanner;

public class UncowedForces
{
	static int minInt=Integer.MIN_VALUE;
	static int maxInt=Integer.MAX_VALUE;
	
	public static void solution(int[] a1,int[] a2,int[] a3)
	{
		int res=0;
		
		for(int i=500;i<2501;i+=500)
			res+=max(3*i/10,(((250-a1[i/500-1])*(i/250))-50*a2[i/500-1]));
		
		res+=a3[0]*100;
		res-=a3[1]*50;
		
		System.out.println(res);
	}
	public static void main(String[] zima)
	{
		Scanner sc=new Scanner(System.in);
		
		int[] a1=new int[5];
		int[] a2=new int[5];
		int[] a3=new int[2];
		
		for(int i=0;i<5;i++)
			a1[i]=sc.nextInt();
		for(int i=0;i<5;i++)
			a2[i]=sc.nextInt();
		for(int i=0;i<2;i++)
			a3[i]=sc.nextInt();
		
		solution(a1,a2,a3);
		sc.close();
	}
	public static int min(int m1,int m2)
	{
		return Math.min(m1, m2);
	}
	public static int max(int m1,int m2)
	{
		return Math.max(m1, m2);
	}
	public static int min(int m1,int m2,int m3,int m4)
	{
		return Math.min(Math.min(Math.min(m1, m2), m3), m4);
	}
	public static int max(int m1,int m2,int m3,int m4)
	{
		return Math.max(Math.min(Math.min(m1, m2), m3), m4);
	}
	public static long arrSum(int[] a1)
	{
		long res=0;
		
		for(int i=0;i<a1.length;i++)
			res+=a1[i];
		
		return res;
	}
	public static long preSum(int[] a1)
	{
		long res=0;
		
		for(int i=0;i<a1.length;i++)
			res+=a1[i];
		
		return res;
	}
}