#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
typedef int64_t lint;
#define rep(i, n) for(int i=0; i<n; i++)
#define repx(i, l, n) for(int i=l; i<n; i++)
#define all(v) v.begin(), v.end()
#define show(x) cout << #x << ": " << x << endl;
#define list(x) cout << #x << ": " << x << "  ";
#define pb push_back
using vi = vector<lint>;
using vvi = vector<vector<lint>>;
template<class T> inline void vin(vector<T>& v) { rep(i, v.size()) cin >> v.at(i); }
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; }
template<class T> inline void drop(T x) { cout << x << endl; exit(0); }
template<class T> void vout(vector<T> v) { rep(i, v.size()) { cout << v.at(i) << ' '; } cout << endl; }
constexpr lint LINF = LLONG_MAX/2;

int main() {
	lint N, K;
	cin >> N >> K;
	N *= 2;
	std::vector<string> S(N);
	vin(S);
	vvi v(N, vi(N));
	rep(i, N) vin(v[i]);

	lint a=0, b=0, c=0, x, y, z;
	rep(i, N) {
		rep(j, N) {
			if (S[i][j] == '#') a++;
		}
	}
	vi w;
	rep(i, N) {
		rep(j, N) {
			w.pb(v[i][j]);
		}
	}
	sort(all(w), greater());
	rep(i, a) b += w[i];
	if (a%2 == 1) drop(b);
	vi t;
	rep(i, N) {
		rep(j, N/2) {
			t.pb(v[i][j] + v[i][N-1-j]);
		}
	}
	sort(all(t), greater());
	rep(i, a/2) c += t[i];
	std::cout << max(b, c+K) << '\n';
}