#define _USE_MATH_DEFINES
#include <bits/stdc++.h>
using namespace std;
#define FOR(i,m,n) for(int i=(m);i<(n);++i)
#define REP(i,n) FOR(i,0,n)
#define ALL(v) (v).begin(),(v).end()
using ll = long long;
constexpr int INF = 0x3f3f3f3f;
constexpr long long LINF = 0x3f3f3f3f3f3f3f3fLL;
constexpr double EPS = 1e-8;
constexpr int MOD = 998244353;
// constexpr int MOD = 1000000007;
constexpr int DY4[]{1, 0, -1, 0}, DX4[]{0, -1, 0, 1};
constexpr int DY8[]{1, 1, 0, -1, -1, -1, 0, 1};
constexpr int DX8[]{0, -1, -1, -1, 0, 1, 1, 1};
template <typename T, typename U>
inline bool chmax(T& a, U b) { return a < b ? (a = b, true) : false; }
template <typename T, typename U>
inline bool chmin(T& a, U b) { return a > b ? (a = b, true) : false; }
struct IOSetup {
  IOSetup() {
    std::cin.tie(nullptr);
    std::ios_base::sync_with_stdio(false);
    std::cout << fixed << setprecision(20);
  }
} iosetup;

int main() {
  int n; ll k; cin >> n >> k;
  int black = 0;
  REP(_, n * 2) REP(_, n * 2) {
    char s; cin >> s;
    black += s == '#';
  }
  vector c(n * 2, vector(n * 2, 0)); REP(i, n * 2) REP(j, n * 2) cin >> c[i][j];
  vector<int> a;
  a.reserve(n * 2 * n * 2);
  REP(i, n * 2) copy(ALL(c[i]), back_inserter(a));
  sort(ALL(a), greater<int>());
  ll ans = accumulate(a.begin(), a.begin() + black, 0LL);
  if (black % 2 == 0) {
    vector<int> b;
    b.reserve(n * 2 * n);
    REP(i, n * 2) REP(j, n) b.emplace_back(c[i][j] + c[i][n * 2 - 1 - j]);
    sort(ALL(b), greater<int>());
    chmax(ans, accumulate(b.begin(), b.begin() + black / 2, 0LL) + k);
  }
  cout << ans << '\n';
  return 0;
}