import sys
input = sys.stdin.readline

N,K=map(int,input().split())
A=list(map(int,input().split()))
C=list(map(int,input().split()))

DP=[[0]*N for i in range(N)]

for i in range(N):
    DP[i][0]=1<<C[i]

for j in range(1,N):
    for i in range(N):
        # DP[i][j]
        # [i,i+j]

        for k in range(j):
            # [i,i+k], [i+k+1,j]
            # DP[i][k], DP[i+k+1][j-k]

            a=DP[i][k]
            b=DP[(i+k+1)%N][j-k-1]

            ANS=0

            for l in range(K+1):
                ANS|=(a&(b<<l))
                ANS|=(a&(b>>l))
                ANS|=(b&(a<<l))
                ANS|=(b&(a>>l))

            DP[i][j]|=ANS
            
    
S=[0]
for a in A+A:
    S.append(S[-1]+a)

ANS=0
for i in range(N):
    for j in range(N):
        if DP[i][j]!=0:
            ANS=max(ANS,S[i+j+1]-S[i])

print(ANS)