#include <iostream>
#include <algorithm>
#include <iomanip>
#include <vector>
#include <queue>
#include <deque>
#include <set>
#include <map>
#include <tuple>
#include <cmath>
#include <numeric>
#include <functional>
#include <cassert>

#define debug_value(x) cerr << "line" << __LINE__ << ":<" << __func__ << ">:" << #x << "=" << x << endl;
#define debug(x) cerr << "line" << __LINE__ << ":<" << __func__ << ">:" << x << endl;

template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }

using namespace std;
typedef long long ll;

template<typename T>
vector<vector<T>> vec2d(int n, int m, T v){
    return vector<vector<T>>(n, vector<T>(m, v));
}

template<typename T>
vector<vector<vector<T>>> vec3d(int n, int m, int k, T v){
    return vector<vector<vector<T>>>(n, vector<vector<T>>(m, vector<T>(k, v)));
}

template<typename T>
void print_vector(vector<T> v, char delimiter=' '){
    if(v.empty()) {
        cout << endl;
        return;
    }
    for(int i = 0; i+1 < v.size(); i++) cout << v[i] << delimiter;
    cout << v.back() << endl;
}

template<typename T>
class Cumsum{
    public:
    Cumsum(vector<T> v): v(v){
        n = v.size();
        v_cumsum = vector<T>(n+1, T(0));
        for(int i = 0; i < n; i++) v_cumsum[i+1] = v_cumsum[i]+v[i];
    }
    /**
     * v[l] + ... + v[r-1]
     */ 
    T sum(int l, int r){
        if(r <= l) return T(0);
        if(r > n) r = n;
        if(l < 0) l = 0;
        return v_cumsum[r]-v_cumsum[l];
    }
    private:
    int n;
    vector<T> v;
    vector<T> v_cumsum;
};

const ll inf = 1e18;

int main(){
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout << setprecision(10) << fixed;
    int n; ll k; cin >> n >> k;
    n *= 2;
    vector<string> s(n);
    for(int i = 0; i < n; i++) cin >> s[i];
    auto c = vec2d(n, n, 0ll);
    vector<ll> v;
    for(int i = 0; i < n; i++){
        for(int j = 0; j < n; j++){
            cin >> c[i][j];
            v.push_back(c[i][j]);
        }
    }
    sort(v.begin(), v.end(), greater<ll>());
    int black = 0;
    for(int i = 0; i < n; i++){
        for(int j = 0; j < n; j++){
            if(s[i][j] == '#') black++;
        }
    }
    ll ans = accumulate(v.begin(), v.begin()+black, 0ll);
    vector<ll> cc, u;
    for(int i = 0; i < n; i++){
        for(int j = 0; j+j < n; j++){
            int k = n-1-j;
            if(j == k){
                cc.push_back(c[i][j]);
            }else{
                u.push_back(c[i][j]+c[i][k]);
            }
        }
    }
    sort(cc.begin(), cc.end(), greater<ll>());
    sort(u.begin(), u.end(), greater<ll>());
    auto cumsum_cc = Cumsum<ll>(cc);
    auto cumsum_u = Cumsum<ll>(u);
    for(int x = 0; x <= cc.size() && x <= black; x++){
        if(black%2 != x%2) continue;
        int rem = (black-x)/2;
        if(rem > u.size()) continue;
        chmax(ans, cumsum_cc.sum(0, x) + cumsum_u.sum(0, rem)+k);
    }
    cout << ans << endl;
}