import java.util.*;
import java.io.*;

public class A {
    public static void main(String[] args) {

        QuickScanner in = new QuickScanner(System.in);
        int p[] = new int[5];
        int m[] = new int[5];
        int w[] = new int[5];
        p[0] = 500;
        for (int i = 1; i < 5; i++)
            p[i] = p[i-1] + 500;
        for (int i = 0; i < 5; i++)
            m[i] = in.nextInt();
        for (int i = 0; i < 5; i++)
            w[i] = in.nextInt();
        int hs = in.nextInt();
        int hu = in.nextInt();

        int score = 0;
        for (int i = 0; i < 5; i++)
        {
            int l = (int)(0.3 * p[i] + 0.5);
            int r = (int)( ((1 - m[i] / 250.0) * p[i]) - 50 * w[i] + 0.5);
            score += Math.max(l, r);
        }
        score += hs * 100;
        score -= hu * 50;
        System.out.println(score);

    }
}



































class QuickScanner {
    BufferedReader in;
    StringTokenizer token;
    String delim;
    public QuickScanner(InputStream inputStream)
    {
        this.in=new BufferedReader(new InputStreamReader(inputStream));
        this.delim=" \n\t";
        this.token=new StringTokenizer("",delim);
    }

    public boolean hasNext()
    {
        while(!token.hasMoreTokens())
        {
            try {
                String s=in.readLine();
                if(s==null) return false;
                token=new StringTokenizer(s,delim);
            } catch (IOException e) {
                throw new InputMismatchException();
            }
        }
        return true;
    }

    public String next()
    {
        hasNext();
        return token.nextToken();
    }

    public int nextInt()
    {
        return Integer.parseInt(next());
    }

}
