#include <iostream>
#include <vector>
#include <iomanip>
#include <algorithm>
#include <map>
#include <cmath>
#include <bitset>
#include <string>
using namespace std;

int main(){
    int n;
    long long k;
    cin >> n >> k;
    vector<string> v(2*n);
    for(int i=0;i<2*n;i++) cin >> v[i];
    int b_count = 0;
    for(int i=0;i<2*n;i++) for(int j=0;j<2*n;j++) if(v[i][j]=='#') b_count++;
    //asymmetry
    vector c(2*n,vector(2*n,0LL));
    vector sc(2*n*2*n,0LL); 
    for(int i=0;i<2*n;i++) for(int j=0;j<2*n;j++) {
        cin >> c[i][j];
        sc[i*2*n+j] = c[i][j];
    }
    sort(sc.begin(),sc.end(),greater<long long>());
    long long ans = 0;
    for(int i=0;i<b_count;i++) ans+=sc[i];
    if(b_count%2!=0){
        cout << ans << endl;
        return 0;
    }
    //symmetry
    vector asc(2*n,0LL);
    for(int i=0;i<2*n;i++){
        for(int j=0;j<n;j++){
            asc[n*i+j] = c[i][j] + c[i][2*n-j-1];
        }
    }
    sort(asc.begin(),asc.end(),greater<long long>());

    long long score = 0;
    for(int i=0;i<b_count/2;i++){
        score+= asc[i];
    }
    score += k;
    cout << max(score,ans) << endl;

}