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 i in range(n)]
for d in range(n):
  for l in range(n):
    r=l+d
    R=r%n
    if l==r:
      dp[l][r]=1<<c[l]
      continue
    for m in range(l,r):
      M0=m%n
      M1=(m+1)%n
      res=dp[l][M0]&dp[M1][R]
      for j in range(1,k+1):
        dp[l][R]|=(dp[l][M0]<<j)&dp[M1][R]
        dp[l][R]|=(dp[M1][R]<<j)&dp[l][M0]
        dp[l][R]|=(dp[l][M0]>>j)&dp[M1][R]
        dp[l][R]|=(dp[M1][R]>>j)&dp[l][M0]
      
      tmp1=dp[l][M0]
      tmp2=dp[l][M0]
      for _ in range(k):
        tmp1>>=1
        tmp2<<=1
        res|=(tmp1|tmp2)&dp[M1][R]
      
      tmp1=dp[M1][R]
      tmp2=dp[M1][R]
      for _ in range(k):
        tmp1>>=1
        tmp2<<=1
        res|=(tmp1|tmp2)&dp[l][M0]
      
      dp[l][R]|=res

ans=0
for l in range(n):
  for r in range(n):
    if dp[l][r]:
      res=0
      if r<l:
        r+=n
      for i in range(l,r+1):
        res+=a[i%n]
      ans=max(ans,res)

print(ans)