import sys
input = sys.stdin.readline

N, K = map(int, input().split())
S = [input()[:-1] for _ in range(2*N)]
C = [list(map(int, input().split())) for _ in range(2*N)]
b = 0

for i in range(2*N):
    for j in range(2*N):
        if S[i][j]=='#':
            b += 1

l = []

for i in range(2*N):
    for j in range(2*N):
        l.append(C[i][j])
    
l.sort(reverse=True)
ans = sum(l[:b])

if b%2==0:
    l = []
    
    for i in range(2*N):
        for j in range(N):
            l.append(C[i][j]+C[i][2*N-1-j])
    
    l.sort(reverse=True)
    ans = max(ans, sum(l[:b//2])+K)

print(ans)