N, K = map(int, input().split())
A = list(map(int, input().split()))
C = list(map(int, input().split()))
dp = [[0 for _ in range(N)] for _ in range(N)]
for i in range(N):
    dp[i][i] = 1<<C[i]

for k in range(N-1):
    for i in range(N):
        for j in range(min(k+1, N-k-1)):
            for l in range(K+1):
                p = dp[i][(i+k)%N]
                q = dp[(i+k+1)%N][(i+k+1+j)%N]
                if (p>>l)&q:
                    dp[i][(i+k+1+j)%N] |= (p>>l)&q | (((p>>l)&q)<<l)
                if p&(q>>l):
                    dp[i][(i+k+1+j)%N] |= p&(q>>l) | ((p&(q>>l))<<l)

                q = dp[(i-1-j)%N][(i-1)%N]
                if (p>>l)&q:
                    dp[(i-1-j)%N][(i+k)%N] |= (p>>l)&q | (((p>>l)&q)<<l)
                if p&(q>>l):
                    dp[(i-1-j)%N][(i+k)%N] |= p&(q>>l) | ((p&(q>>l))<<l)


#print(dp)

AA = A+A
S = [0]
for a in AA:
    S.append(S[-1]+a)
#print(S)
ans = 0
for i in range(N):
    for j in range(N):
        if dp[i][j]==0:
            continue
        if i>j:
            ans = max(ans, S[j+1+N]-S[i])
        else:
            ans = max(ans, S[j+1]-S[i])
print(ans)