N, K = map(int, input().split())
S = [input() for _ in range(2*N)]
C = [list(map(int, input().split())) for _ in range(2*N)]
C_1dim = []
symetry_point = []

black_ct = 0
for i in range(2*N):
    for j in range(2*N):
        if S[i][j] == "#":
            black_ct += 1
        C_1dim.append(C[i][j])

    for k in range(N):
        symetry_point.append(C[i][k]+C[i][-(k+1)])

C_1dim.sort()
symetry_point.sort()

ans = sum(C_1dim[-black_ct:])
if black_ct == 0:
    print(K)
elif black_ct%2 == 1:
    print(ans)
else:
    print(max(ans, sum(symetry_point[-(black_ct//2):])+K))