N, K = map(int, input().split())
bk_count = 0
for i in range(2 * N):
    S = str(input())
    for j in range(2 * N):
        if S[j] == '#':
            bk_count += 1

lst_c = [[0 for _ in range(2 * N)] for _ in range(2 * N)]
for i in range(2 * N):
    C = list(map(int, input().split()))
    for j in range(2 * N):
        lst_c[i][j] = C[j]

lst1 = []
for i in range(2 * N):
    for j in range(2 * N):
        lst1.append(lst_c[i][j])
lst1.sort(reverse=True)
ans1 = 0
for i in range(bk_count):
    ans1 += lst1[i]

if bk_count % 2 != 0:
    print(ans1)
    exit()

lst2 = []
for i in range(2 * N):
    for j in range(N):
        lst2.append(lst_c[i][j] + lst_c[i][2 * N - 1 - j])
lst2.sort(reverse=True)
ans2 = 0
for i in range(bk_count // 2):
    ans2 += lst2[i]
print(max(ans1, ans2 + K))