#pragma GCC target("avx") #pragma GCC optimize("O3") #pragma GCC optimize("unroll-loops") #include using namespace std; #define rep(i,n) for(int i = 0; i < (int)n; i++) #define FOR(n) for(int i = 0; i < (int)n; i++) #define repi(i,a,b) for(int i = (int)a; i < (int)b; i++) #define pb push_back #define all(x) x.begin(),x.end() //#define mp make_pair #define vi vector #define vvi vector #define vll vector #define vvll vector #define vs vector #define vvs vector #define vc vector #define vvc vector #define pii pair #define pllll pair #define vpii vector> #define vpllll vector> #define vpis vector> #define vplls vector> #define vpsi vector> #define vpsll vector> template void chmax(T &a, const T &b) {a = (a > b? a : b);} template void chmin(T &a, const T &b) {a = (a < b? a : b);} using ll = long long; using ld = long double; using ull = unsigned long long; const ll INF = numeric_limits::max() / 2; const ld pi = 3.1415926535897932384626433832795028; const ll mod = 998244353; int dx[] = {-1, 0, 1, 0, -1, -1, 1, 1}; int dy[] = {0, -1, 0, 1, -1, 1, -1, 1}; #define int long long void solve() { int n, k; cin >> n >> k; n *= 2; vector s(n); FOR(n) cin >> s[i]; vvi c(n, vi(n)); rep(i, n) rep(j, n) cin >> c[i][j]; int cnt = 0; rep(i, n) rep(j, n) if(s[i][j] == '#') cnt++; vi sorted; for(auto e : c) for(auto f : e) sorted.push_back(f); sort(all(sorted), greater()); int ans = 0; FOR(cnt) ans += sorted[i]; if(cnt%2==0) { vi combined; rep(i, n) { rep(j, n/2) { combined.push_back(c[i][j]+c[i][n-1-j]); } } sort(all(combined), greater()); int ans1 = k; FOR(cnt/2) ans1 += combined[i]; chmax(ans, ans1); } cout << ans << endl; } signed main() { cin.tie(nullptr); ios::sync_with_stdio(false); solve(); return 0; }