#include <bits/stdc++.h>
using namespace std;
#define rep(i, x, limit) for (long long i = (long long)x; i < (long long)limit; i++)
#define REP(i, x, limit) for (long long i = (long long)x; i <= (long long)limit; i++)
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define el endl
#define spa " "
#define Yes cout << "Yes" << el
#define No cout << "No" << el
#define YES cout << "YES" << el
#define NO cout << "NO" << el
#define eps (1e-10)
#define Equals(a,b) (fabs((a) - (b)) < eps )
#define debug(x) cerr << #x << " = " << x << el
using ll = long long;
using ull = unsigned long long;
using pii = pair<int,int>;
using pll = pair<ll,ll>;
using vi = vector<int>;
using vl = vector<ll>;
using vvl = vector<vector<ll>>;
using vs = vector<string>;
using vb = vector<bool>;
const double pi = 3.141592653589793238;
const int inf = 1073741823;
const ll infl = 1LL << 60;
const string ABC = "ABCDEFGHIJKLMNOPQRSTUVWXYZ";
const string abc = "abcdefghijklmnopqrstuvwxyz";
const ll MOD = 998244353;
#include<atcoder/all>
using namespace atcoder;
using mint = modint998244353;
using vm = vector<mint>;

int main() {
  ios::sync_with_stdio(false);
  cin.tie(nullptr);
  ll n,k,sc1=0,sc2=0,cnt=0;cin>>n>>k;
  vs S(2*n);rep(i,0,2*n)cin>>S[i];
  vl Cs,Cs2;
  vvl C(2*n,vl(2*n));rep(i,0,2*n)rep(j,0,2*n)cin>>C[i][j];
  rep(i,0,2*n)rep(j,0,2*n){
    Cs.push_back(C[i][j]);
    if(S[i][j]=='#')cnt++;
  }
  sort(rall(Cs));
  sc1=reduce(Cs.begin(),Cs.begin()+cnt);
  if(cnt%2==1){
    cout<<sc1<<el;
    return 0;
  }
  rep(i,0,2*n)rep(j,0,n){
    Cs2.push_back(C[i][j]+C[i][2*n-1-j]);
  }
  sort(rall(Cs2));
  sc2=reduce(Cs2.begin(),Cs2.begin()+cnt/2);
  cout<<max(sc1,sc2+k)<<el;
}