#include #include using namespace std; using namespace atcoder; typedef long long int ll; typedef long double ld; typedef vector vi; typedef vector vvi; typedef vector vvvi; typedef vector vvvvi; typedef pair pi; typedef pair ppi; typedef pair pppi; typedef pair ppppi; #define FOR(i,l,r) for(ll i=l;i=l;i--) #define RREP(i,n) RFOR(i,0,n) #define ALL(x) x.begin(),x.end() #define F first #define S second #define BS(A,x) binary_search(ALL(A),x) #define LB(A,x) (ll)(lower_bound(ALL(A),x)-A.begin()) #define UB(A,x) (ll)(upper_bound(ALL(A),x)-A.begin()) #define COU(A,x) (UB(A,x)-LB(A,x)) #define sz(c) ((ll)(c).size()) /* #include namespace mp=boost::multiprecision; using Bint=mp::cpp_int; */ templateusing min_priority_queue=priority_queue,greater>; templateostream&operator<<(ostream&os,pair&p){os<istream&operator>>(istream&is,pair&p){is>>p.F>>p.S;return is;} templateostream&operator<<(ostream&os,vector&v){REP(i,sz(v))os<istream&operator>>(istream&is,vector&v){for(T&in:v)is>>in;return is;} templatebool chmax(T&a,T b){if(abool chmin(T&a,T b){if(b vm; typedef vector vvm; typedef vector vvvm; typedef vector vvvvm; ostream&operator<<(ostream&os,mint&a){os<>N>>K; vi A(N),C(N);cin>>A>>C; REP(i,N)A.emplace_back(A[i]); REP(i,N)C.emplace_back(C[i]); vector>>DP(2*N,vector>(N+1,vector(51))); REP(i,2*N)DP[i][1][C[i]]=1; FOR(d,2,N+1){ REP(i,2*N+1-d)REP(c,51){ FOR(d1,1,d){ if(DP[i+d1][d-d1][c])FOR(c1,max(0LL,c-K),min(51LL,c+K+1))if(DP[i][d1][c1]){DP[i][d][c]=1;break;} if(DP[i][d1][c])FOR(c1,max(0LL,c-K),min(51LL,c+K+1))if(DP[i+d1][d-d1][c1]){DP[i][d][c]=1;break;} if(DP[i][d][c])break; } } } ll ans=0; REP(i,N)FOR(d,1,N+1){ ll s=0; FOR(j,i,i+d)s+=A[j]; REP(c,51)if(DP[i][d][c])chmax(ans,s); } cout<