#include<bits/stdc++.h>
namespace {
#pragma GCC diagnostic push
#pragma GCC diagnostic ignored "-Wunused-function"
#include<atcoder/all>
#pragma GCC diagnostic pop
using namespace std;
using namespace atcoder;
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define rrep(i,n) for(int i = (int)(n) - 1; i >= 0; i--)
#define all(x) begin(x), end(x)
#define rall(x) rbegin(x), rend(x)
template<class T> bool chmax(T& a, const T& b) { if (a < b) { a = b; return true; } else return false; }
template<class T> bool chmin(T& a, const T& b) { if (b < a) { a = b; return true; } else return false; }
using ll = long long;
using P = pair<int,int>;
using VI = vector<int>;
using VVI = vector<VI>;
using VL = vector<ll>;
using VVL = vector<VL>;

} int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  int n;
  ll k;
  cin >> n >> k;
  int cnt = 0;
  rep(_, 2 * n) {
    string s;
    cin >> s;
    for(char c: s) cnt += c == '#';
  }
  constexpr long long INF = 1002003004005006007;
  VL dp[2];
  rep(i, 2) dp[i].assign(cnt + 1, -INF);
  dp[0][0] = 0;
  rep(_, 2 * n) {
    VL cs(2 * n);
    rep(i, 2 * n) cin >> cs[i];
    VL cs_sym(n);
    rep(i, n) cs_sym[i] = cs[i] + cs[2 * n - 1 - i];
    sort(rall(cs_sym));
    rep(i, n - 1) cs_sym[i+1] += cs_sym[i];
    VL cs_sorted = cs;
    sort(rall(cs_sorted));
    rep(i, 2 * n - 1) cs_sorted[i+1] += cs_sorted[i];
    rrep(i, cnt) {
      ll v = max(dp[0][i], dp[1][i]);
      if (v != -INF) {
        rep(idx, 2 * n) {
          int j = i + idx + 1;
          if (j > cnt) break;
          chmax(dp[1][j], v + cs_sorted[idx]);
        }
      }
      v = dp[0][i];
      if (v != -INF) {
        rep(idx, n) {
          int j = i + 2 * (idx + 1);
          if (j > cnt) break;
          chmax(dp[0][j], v + cs_sym[idx]);
        }
      }
    }
  }
  ll ans = max(dp[0][cnt] + k, dp[1][cnt]);
  cout << ans << '\n';
}