Uncowed Forces 【水题】

刚读完题感觉是个水题，因为题目中有公式，然后我笔算第一个样例竟然没得到结果，然后就搁置了，后来竟然敲出来了，水题，注意数据类型就行，，，

D - Uncowed Forces

 

Kevin Sun has just finished competing in Codeforces Round #334! The round was 120 minutes long and featured five problems with maximum point values of 500, 1000, 1500, 2000, and 2500, respectively. Despite the challenging tasks, Kevin was uncowed and bulldozed through all of them, distinguishing himself from the herd as the best cowmputer scientist in all of Bovinia. Kevin knows his submission time for each problem, the number of wrong submissions that he made on each problem, and his total numbers of successful and unsuccessful hacks. Because Codeforces scoring is complicated, Kevin wants you to write a program to compute his final score.

Codeforces scores are computed as follows: If the maximum point value of a problem is x, and Kevin submitted correctly at minute m but made w wrong submissions, then his score on that problem is . His total score is equal to the sum of his scores for each problem. In addition, Kevin's total score gets increased by 100 points for each successful hack, but gets decreased by 50 points for each unsuccessful hack.

All arithmetic operations are performed with absolute precision and no rounding. It is guaranteed that Kevin's final score is an integer.

Input

The first line of the input contains five space-separated integers m₁, m₂, m₃, m₄,m₅, where m_i (0 ≤ m_i ≤ 119) is the time of Kevin's last submission for problem i. His last submission is always correct and gets accepted.

The second line contains five space-separated integers w₁, w₂, w₃, w₄, w₅, where w_i(0 ≤ w_i ≤ 10) is Kevin's number of wrong submissions on problem i.

The last line contains two space-separated integers h_s and h_u (0 ≤ h_s, h_u ≤ 20), denoting the Kevin's numbers of successful and unsuccessful hacks, respectively.

Output

Print a single integer, the value of Kevin's final score.

Example

Input

20 40 60 80 1000 1 2 3 41 0

Output

4900

Input

119 119 119 119 1190 0 0 0 010 0

Output

4930

#include<cstdio>#include<algorithm>using namespace std;int main(){int m[5],w[5];int p,q;for(int i=0;i<5;i++)scanf("%d",&m[i]);for(int i=0;i<5;i++)scanf("%d",&w[i]);scanf("%d%d",&p,&q);double ans=0;for(int i=0;i<5;i++){double x=500.0*(i+1);ans+=max(0.3*x,(1-(double)m[i]/250.0)*x-50*(double)w[i] );}ans=ans+100*p-50*q;printf("%.lf\n",ans);return 0; }