### CF

#### Problem Description

LYD loves codeforces since there are many Russian contests. In an contest lasting for *T* minutes there are *n* problems, and for the *i**th* problem you can get *a**i*−*d**i*∗*t**i* points, where *a**i* indicates the initial points, *d**i* indicates the points decreased per minute (count from the beginning of the contest), and *t**i* stands for the passed minutes when you solved the problem (count from the begining of the contest).

Now you know LYD can solve the *i**th* problem in *c**i* minutes. He can't perform as a multi-core processor, so he can think of only one problem at a moment. Can you help him get as many points as he can?

#### Input

The first line contains two integers *n*,*T*(0≤*n*≤2000,0≤*T*≤5000).

The second line contains *n* integers *a*1,*a*2,..,*a**n*(0<*a**i*≤6000).

The third line contains *n* integers *d*1,*d*2,..,*d**n*(0<*d**i*≤50).

The forth line contains *n* integers *c*1,*c*2,..,*c**n*(0<*c**i*≤400).

#### Output

Output an integer in a single line, indicating the maximum points LYD can get.

#### Sample Input

3 10 100 200 250 5 6 7 2 4 10

#### Sample Output

254