#include<iostream> #include<cstdio> #include<algorithm> #include<cstring> #include<queue> using namespace std; const int maxn=50; int n,h,sum,ans; struct node{ int f,d,t,id; bool operator <(node x)const{ return f<x.f; } }e[maxn*2]; priority_queue<node>q; void cd(int ii,int ji){ for(int i=ii;i<=ji;i++){ q.push(e[i]); } } int main(){ scanf("%d%d",&n,&h); h*=12; for(int i=1;i<=n;i++){ scanf("%d",&e[i].f); e[i].id=i; } for(int i=1;i<=n;i++) scanf("%d",&e[i].d); for(int i=2;i<=n;i++){ scanf("%d",&e[i].t); e[i].t+=e[i-1].t; } for(int j=1;j<=n;j++){ int flag=h; flag-=e[j].t; cd(1,j); while(!q.empty()){ if(flag-1<0){ q.pop(); continue; } else{ flag--; node m=q.top(); q.pop(); sum+=m.f; if(m.f-m.d>0){ m.f-=m.d; q.push(m); } } } ans=max(sum,ans); sum=0; } cout<<ans; return 0; }