#include <bits/stdc++.h>
using namespace std;
const int INF = (int)1.01e9;
struct Edge {
  int to, cap, flow;
};
struct Graph {
  int n;
  vector<vector<int>> e;
  vector<Edge> edges;
  vector<int> d, c;
  int t;
  Graph() {}
  Graph(int _n) {
    n = _n;
    e.resize(n);
  }
  void addEdge(int from, int to, int cap) {
    e[from].push_back(edges.size());
    edges.push_back(Edge({to, cap, 0}));
    e[to].push_back(edges.size());
    edges.push_back(Edge({from, 0, 0}));
  }
  bool bfs() {
    d.assign(n, INF);
    c.assign(n, 0);
    vector<int> q(n);
    int qL = 0, qR = 0;
    d[0] = 0;
    q[qR++] = 0;
    while (qL < qR) {
      int v = q[qL++];
      for (int i = 0; i < (int)e[v].size(); i++) {
        Edge cur = edges[e[v][i]];
        if (d[cur.to] > d[v] + 1 && cur.cap - cur.flow >= t) {
          d[cur.to] = d[v] + 1;
          q[qR++] = cur.to;
        }
      }
    }
    return d[n - 1] != INF;
  }
  int dfs(int v, int flow) {
    if (flow != t) return 0;
    if (v == n - 1) return flow;
    for (int &i = c[v]; i < (int)e[v].size(); i++) {
      Edge cur = edges[e[v][i]];
      if (d[cur.to] != d[v] + 1) continue;
      int pushed = dfs(cur.to, min(flow, cur.cap - cur.flow));
      if (pushed > 0) {
        edges[e[v][i]].flow += pushed;
        edges[e[v][i] ^ 1].flow -= pushed;
        return pushed;
      }
    }
    return 0;
  }
  long long flow() {
    long long flow = 0;
    for (t = (1 << 30); t >= 1; t >>= 1) {
      while (bfs()) {
        while (int pushed = dfs(0, t)) {
          flow += pushed;
        }
      }
    }
    return flow;
  }
};
char sci[10][10];
char safe[10][10];
int dist[10][10];
vector<pair<int, int>> dir = {{1, 0}, {-1, 0}, {0, -1}, {0, 1}};
int main() {
  int n, t;
  cin >> n >> t;
  pair<int, int> bm;
  for (int i = 0; i < n; i++) {
    for (int j = 0; j < n; j++) {
      cin >> sci[i][j];
      if (sci[i][j] == 'Z') {
        bm = {i, j};
      }
    }
  }
  for (int i = 0; i < n; i++) {
    for (int j = 0; j < n; j++) {
      dist[i][j] = 1e9;
    }
  }
  for (int i = 0; i < n; i++) {
    for (int j = 0; j < n; j++) {
      cin >> safe[i][j];
    }
  }
  Graph g = Graph(2 * n * n + 2);
  deque<pair<int, int>> q = {bm};
  dist[bm.first][bm.second] = 0;
  while (!q.empty()) {
    auto v = q.front();
    q.pop_front();
    for (auto d : dir) {
      if (v.first + d.first < n && v.first + d.first >= 0 &&
          v.second + d.second < n && v.second + d.second >= 0 &&
          dist[v.first + d.first][v.second + d.second] == 1e9) {
        if (sci[v.first + d.first][v.second + d.second] != 'Y') {
          dist[v.first + d.first][v.second + d.second] =
              dist[v.first][v.second] + 1;
          q.push_back({v.first + d.first, v.second + d.second});
        }
      }
    }
  }
  for (int i = 0; i < n; i++) {
    for (int j = 0; j < n; j++) {
      if (sci[i][j] == 'Z' || sci[i][j] == 'Y') continue;
      deque<pair<int, int>> h = {{i, j}};
      vector<vector<int>> ds(n, vector<int>(n, 1e9));
      ds[i][j] = 0;
      while (!h.empty()) {
        auto v = h.front();
        h.pop_front();
        for (auto d : dir) {
          if (v.first + d.first < n && v.first + d.first >= 0 &&
              v.second + d.second < n && v.second + d.second >= 0 &&
              ds[v.first + d.first][v.second + d.second] == 1e9) {
            if (sci[v.first + d.first][v.second + d.second] != 'Y' &&
                sci[v.first + d.first][v.second + d.second] != 'Z' &&
                ds[v.first][v.second] + 1 <=
                    dist[v.first + d.first][v.second + d.second]) {
              ds[v.first + d.first][v.second + d.second] =
                  ds[v.first][v.second] + 1;
              if (ds[v.first + d.first][v.second + d.second] <
                  dist[v.first + d.first][v.second + d.second])
                h.push_back({v.first + d.first, v.second + d.second});
              if (ds[v.first + d.first][v.second + d.second] ==
                  dist[v.first + d.first][v.second + d.second])
                ds[v.first + d.first][v.second + d.second]--;
            }
          }
        }
      }
      for (int i2 = 0; i2 < n; i2++) {
        for (int j2 = 0; j2 < n; j2++) {
          if (ds[i2][j2] <= t) {
            g.addEdge(i * n + j + 1, n * n + i2 * n + j2 + 1, INF);
          }
        }
      }
    }
  }
  for (int i = 0; i < n; i++) {
    for (int j = 0; j < n; j++) {
      if (sci[i][j] >= '0' && sci[i][j] <= '9')
        g.addEdge(0, i * n + j + 1, sci[i][j] - '0');
    }
  }
  for (int i = 0; i < n; i++) {
    for (int j = 0; j < n; j++) {
      if (safe[i][j] >= '0' && safe[i][j] <= '9') {
        g.addEdge(n * n + i * n + j + 1, 2 * n * n + 1, safe[i][j] - '0');
      }
    }
  }
  cout << g.flow();
  return 0;
}
