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

using namespace std;
using ll = long long;

int main(){

    ll N, K, cnt=0, ans=0, tot=0;
    cin >> N >> K;
    N *= 2;
    vector<ll> v1, v2;
    vector<string> S(N);
    vector<vector<ll>> C(N, vector<ll>(N));
    for (int i=0; i<N; i++){
        cin >> S[i];
        for (auto c : S[i]) if (c == '#') cnt++;
    }
    for (int i=0; i<N; i++){
        for (int j=0; j<N; j++){
            cin >> C[i][j];
            v1.push_back(C[i][j]);
        }
        for (int j=0; j<N/2; j++){
            v2.push_back(C[i][j]+C[i][N-1-j]);
        }
    }

    sort(v1.begin(), v1.end(), greater<ll>());
    sort(v2.begin(), v2.end(), greater<ll>());

    for (int i=0; i<cnt; i++) tot += v1[i];
    ans = tot;
    if (cnt % 2 == 0){
        cnt /= 2;
        tot = 0;
        for (int i=0; i<cnt; i++) tot += v2[i];
        ans = max(ans, tot+K);
    }

    cout << ans << endl;

    return 0;
}