n, k = map(int, input().split())
a = list(map(int, input().split()))
c = list(map(lambda x: int(x)-1, input().split()))
dp = [[0] * n for _ in range(n)]
for i in range(n):
  dp[i][i] = 1 << c[i]
for i in range(1, n):
  for l in range(n):
    r = (l + i) % n
    for j in range(i):
      m = (l + j) % n
      for p in range(k+1):
        dp[l][r] |= ((dp[l][m] << p) & dp[(m+1)%n][r])
        dp[l][r] |= ((dp[l][m] >> p) & dp[(m+1)%n][r])
        dp[l][r] |= (dp[l][m] & (dp[(m+1)%n][r] << p))
        dp[l][r] |= (dp[l][m] & (dp[(m+1)%n][r] >> p))
s = [0]
for i in range(n):
  s.append(s[i]+a[i])
ans = 0
for i in range(n):
  for j in range(n):
    if dp[i][j]:
      if i <= j:
        ans = max(ans, s[j+1]-s[i])
      else:
        ans = max(ans, s[n]-s[i]+s[j+1])
print(ans)