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

int main(){
    ios::sync_with_stdio(false);
    cin.tie(0);
    ll n, k, cnt = 0, idx1 = 0, idx2 = 0;
    cin >> n >> k;
    vector<string> A(2 * n);
    vector<vector<ll>> C(2 * n, vector<ll>(2 * n));
    vector<ll> c1(4 * n * n), c2(2 * n * n);
    for(auto &&s:A){
        cin >> s;
        cnt += count(s.begin(), s.end(), '#');
    }
    for(int y = 0; y < 2 * n; y++){
        for(int x = 0; x < 2 * n; x++){
            cin >> C[y][x];
            c1[idx1++] = C[y][x];
        }
        for(int x = 0; x < n; x++){
            c2[idx2++] = C[y][x] + C[y][2 * n - 1 - x];
        }
    }
    sort(c1.rbegin(), c1.rend());
    sort(c2.rbegin(), c2.rend());
    ll ans = -(1ll << 60);
    if(cnt % 2 == 0)ans = max(ans, accumulate(c2.begin(), c2.begin() + cnt / 2, 0ll) + k);
    ans = max(ans, accumulate(c1.begin(), c1.begin() + cnt, 0ll));
    cout << ans << '\n';
}