#include <bits/stdc++.h>
using namespace std;
struct FlowEdge {
  int v, u;
  long long int cap, flow = 0;
  FlowEdge(int v, int u, long long int cap) : v(v), u(u), cap(cap) {}
};
struct Dinic {
  const long long int flow_inf = 1e18;
  vector<FlowEdge> edges;
  vector<vector<int>> adj;
  int n, m = 0;
  int s, t;
  vector<int> level, ptr;
  queue<int> q;
  Dinic(int n, int s, int t) : n(n), s(s), t(t) {
    adj.resize(n);
    level.resize(n);
    ptr.resize(n);
  }
  void add(int v, int u, long long int cap) {
    edges.emplace_back(v, u, cap);
    edges.emplace_back(u, v, 0);
    adj[v].push_back(m);
    adj[u].push_back(m + 1);
    m += 2;
  }
  bool bfs() {
    while (!q.empty()) {
      int v = q.front();
      q.pop();
      for (int viz : adj[v]) {
        if (edges[viz].cap - edges[viz].flow < 1) continue;
        if (level[edges[viz].u] != -1) continue;
        level[edges[viz].u] = level[v] + 1;
        q.push(edges[viz].u);
      }
    }
    return level[t] != -1;
  }
  long long int dfs(int v, long long int pushed) {
    if (pushed == 0) return 0;
    if (v == t) return pushed;
    for (int &i = ptr[v]; i < (int)adj[v].size(); i++) {
      int viz = adj[v][i];
      int u = edges[viz].u;
      if (level[v] + 1 != level[u] || edges[viz].cap - edges[viz].flow < 1)
        continue;
      long long int tr = dfs(u, min(pushed, edges[viz].cap - edges[viz].flow));
      if (tr == 0) continue;
      edges[viz].flow += tr;
      edges[viz ^ 1].flow -= tr;
      return tr;
    }
    return 0;
  }
  long long int flow() {
    long long int f = 0;
    while (true) {
      fill(level.begin(), level.end(), -1);
      level[s] = 0;
      q.push(s);
      if (!bfs()) break;
      fill(ptr.begin(), ptr.end(), 0);
      while (long long int pushed = dfs(s, flow_inf)) f += pushed;
    }
    return f;
  }
};
int pos[150][150], matTempo[150][150], matAlc[150][150];
vector<pair<int, int>> pegaVizinhos(int i, int j, vector<string> mat, int n) {
  vector<pair<int, int>> viz;
  if (i + 1 < n) viz.push_back({i + 1, j});
  if (i - 1 >= 0) viz.push_back({i - 1, j});
  if (j + 1 < n) viz.push_back({i, j + 1});
  if (j - 1 >= 0) viz.push_back({i, j - 1});
  return viz;
}
void criaMatTempo(int i, int j, vector<string> sc, int n, int currT) {
  if (i >= n || i < 0 || j >= n || j < 0 ||
      (!isdigit(sc[i][j]) && sc[i][j] != 'Z') ||
      (matTempo[i][j] != -1 and matTempo[i][j] <= currT))
    return;
  if (matTempo[i][j] == -1)
    matTempo[i][j] = currT;
  else
    matTempo[i][j] = min(currT, matTempo[i][j]);
  criaMatTempo(i + 1, j, sc, n, currT + 1);
  criaMatTempo(i - 1, j, sc, n, currT + 1);
  criaMatTempo(i, j + 1, sc, n, currT + 1);
  criaMatTempo(i, j - 1, sc, n, currT + 1);
}
void criaMatAlc(int i, int j, vector<string> sc, int n, int currT) {
  if (i >= n || i < 0 || j >= n || j < 0 ||
      (matAlc[i][j] != -1 and matAlc[i][j] <= currT) || !isdigit(sc[i][j]))
    return;
  if (matAlc[i][j] == -1)
    matAlc[i][j] = currT;
  else
    matAlc[i][j] = min(currT, matAlc[i][j]);
  criaMatAlc(i + 1, j, sc, n, currT + 1);
  criaMatAlc(i - 1, j, sc, n, currT + 1);
  criaMatAlc(i, j + 1, sc, n, currT + 1);
  criaMatAlc(i, j - 1, sc, n, currT + 1);
}
int main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  int n, t, n2, nMax, iZ, jZ;
  string aux;
  cin >> n >> t;
  n2 = n * n;
  nMax = n2 * 2;
  Dinic grafo = Dinic(nMax + 2, 0, nMax + 1);
  vector<string> sc(n), caps(n);
  int cnt = 1;
  for (int i = 0; i < n; i++) {
    for (int j = 0; j < n; j++) {
      pos[i][j] = cnt;
      cnt++;
    }
  }
  for (int i = 0; i < n; i++) {
    cin >> sc[i];
    for (int j = 0; j < n; j++) {
      if (sc[i][j] == 'Z') {
        iZ = i;
        jZ = j;
      }
    }
  }
  for (int i = 0; i < n; i++) cin >> caps[i];
  memset(matTempo, -1, sizeof(matTempo));
  criaMatTempo(iZ, jZ, sc, n, 0);
  for (int i = 0; i < n; i++) {
    for (int j = 0; j < n; j++) {
      if (matTempo[i][j] == -1 and isdigit(sc[i][j])) matTempo[i][j] = t;
    }
  }
  for (int i = 0; i < n; i++) {
    for (int j = 0; j < n; j++) {
      memset(matAlc, -1, sizeof(matAlc));
      if (isdigit(sc[i][j])) {
        int lmt = sc[i][j] - '0';
        grafo.add(0, pos[i][j], lmt);
        criaMatAlc(i, j, sc, n, 0);
        for (int k = 0; k < n; k++) {
          for (int l = 0; l < n; l++) {
            if (matAlc[k][l] != -1 and matTempo[k][l] != -1 and
                matAlc[k][l] <= matTempo[k][l] and matAlc[k][l] <= t) {
              bool crt = true;
              if (matAlc[k][l] == matTempo[k][l]) {
                crt = false;
                if (k + 1 < n and matAlc[k + 1][l] != -1 and
                    matAlc[k + 1][l] < matTempo[k + 1][l])
                  crt = true;
                if (k - 1 >= 0 and matAlc[k - 1][l] != -1 and
                    matAlc[k - 1][l] < matTempo[k - 1][l])
                  crt = true;
                if (l + 1 < n and matAlc[k][l + 1] != -1 and
                    matAlc[k][l + 1] < matTempo[k][l + 1])
                  crt = true;
                if (l - 1 >= 0 and matAlc[k][l - 1] != -1 and
                    matAlc[k][l - 1] < matTempo[k][l - 1])
                  crt = true;
              }
              if (crt) {
                grafo.add(pos[i][j], n2 + pos[k][l], lmt);
              }
            }
          }
        }
      }
    }
  }
  for (int i = 0; i < n; i++) {
    for (int j = 0; j < n; j++) {
      if (isdigit(caps[i][j])) {
        grafo.add(n2 + pos[i][j], nMax + 1, caps[i][j] - '0');
      }
    }
  }
  long long int ans = grafo.flow();
  cout << ans << '\n';
}
