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

int main(){
    int64_t N, K; cin >> N >> K;
    int64_t B = 0;
    for(int64_t i = 0; i < 2*N; i++){
        for(int64_t j = 0; j < 2*N; j++){
            char c; cin >> c;
            if(c == '#') B++;
        }
    }
    vector C(2*N, vector(2*N, int64_t()));
    vector<int64_t> Crow;
    vector<int64_t> Csym;
    for(int64_t i = 0; i < 2*N; i++){
        for(int64_t j = 0; j < 2*N; j++){
            cin >> C[i][j];
            Crow.push_back(C[i][j]);
            if(j >= N) C[i][2*N-1-j] += C[i][j];
        }
    }
    for(int64_t i = 0; i < 2*N; i++){
        for(int64_t j = 0; j < N; j++){
            Csym.push_back(C[i][j]);
        }
    }
    sort(Crow.begin(), Crow.end(), greater<int64_t>{});
    int64_t res_row = 0;
    for(int64_t i = 0; i < B; i++) res_row += Crow[i];
    sort(Csym.begin(), Csym.end(), greater<int64_t>{});
    int64_t res_sym = INT64_MIN;
    if(B % 2 == 0){
        B >>= 1;
        res_sym = 0;
        for(int64_t i = 0; i < B; i++) res_sym += Csym[i];
    }
    cout << max(res_row, res_sym + K) << '\n';
}