#include<bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i,n) for (int i = 0; i < n; i++)
#define rrep(i,n) for (int i = (n) - 1; i >= 0; i--)

int n;
ll k,C[510][510];
int main(){
    ios::sync_with_stdio(false);
    std::cin.tie(nullptr);
    cin>>n>>k;
    int cnt=0;
    rep(i,2*n){
        string s;
        cin>>s;
        rep(j,2*n)if(s[j]=='#')cnt++;
    }
    vector<ll>v;
    rep(i,2*n)rep(j,2*n){
        cin>>C[i][j];
        v.push_back(C[i][j]);
    }
    sort(v.rbegin(),v.rend());
    ll ans=0;
    rep(i,cnt)ans+=v[i];
    if(cnt%2==0){
        vector<ll>w;
        rep(i,2*n){
            rep(j,n){
                w.push_back(C[i][j]+C[i][2*n-1-j]);
            }
        }
        sort(w.rbegin(),w.rend());
        rep(i,cnt/2)k+=w[i];
        ans=max(ans,k);
    }
    cout<<ans<<"\n";
}