#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main () {
    int N;
    ll K;
    cin >> N >> K;
    N *= 2;
    int b = 0;
    for (int i = 0; i < N * N; i ++) {
        char c;
        cin >> c;
        b += (c == '#');
    }
    ll C1[90000];
    for (int i = 0; i < N * N; i ++) {
        cin >> C1[i];
    }
    ll C2[90000];
    for (int i = 0; i < (N * N) / 2; i ++) {
        int p = i / (N / 2), q = i % (N / 2);
        C2[i] = C1[p * N + q] + C1[p * N + N - q - 1];
    }
    sort(C1, C1 + (N * N));
    sort(C2, C2 + (N * N / 2));
    ll ans1 = 0;
    for (int i = 0; i < b; i ++) {
        ans1 += C1[N * N - 1 - i];
    }
    if (b % 2) {
        cout << ans1 << endl;
        return 0;
    }
    ll ans2 = 0;
    for (int i = 0; i < b / 2; i ++) {
        ans2 += C2[N * N / 2 - 1 - i];
    }
    cout << max(ans1, ans2 + K) << endl;
}