#include <bits/stdc++.h>
using namespace std;

int main() {
    int64_t N, K;
    cin >> N >> K;
    const int64_t M = 2 * N;
    vector<string> S(M);
    for (string& s : S) {
        cin >> s;
    }
    vector<vector<int64_t>> C(M, vector<int64_t>(M));
    for (int64_t i = 0; i < M; i++) {
        for (int64_t j = 0; j < M; j++) {
            cin >> C[i][j];
        }
    }

    int64_t black_num = 0;
    for (int64_t i = 0; i < M; i++) {
        for (int64_t j = 0; j < M; j++) {
            black_num += (S[i][j] == '#');
        }
    }

    // シンメトリー考えない
    vector<int64_t> value;
    for (int64_t i = 0; i < M; i++) {
        for (int64_t j = 0; j < M; j++) {
            value.push_back(C[i][j]);
        }
    }
    sort(value.begin(), value.end(), greater<>());
    int64_t ans = accumulate(value.begin(), value.begin() + black_num, (int64_t)0);

    // シンメトリー考える
    if (black_num % 2 == 0) {
        value.clear();
        for (int64_t i = 0; i < M; i++) {
            for (int64_t j = 0; j < N; j++) {
                value.push_back(C[i][j] + C[i][M - 1 - j]);
            }
        }
        sort(value.begin(), value.end(), greater<>());
        const int64_t ans1 = accumulate(value.begin(), value.begin() + black_num / 2, (int64_t)0);
        ans = max(ans, ans1 + K);
    }

    cout << ans << endl;
}