#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
#pragma GCC target("avx,avx2,fma")
#pragma GCC optimization("unroll-loops")
using namespace std;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
const long long N = 10;
struct fedge {
  long long v, u;
  long long cap, flow = 0;
  fedge(long long v, long long u, long long cap) : v(v), u(u), cap(cap) {}
};
struct dinic {
  const long long flow_inf = 1e18;
  vector<fedge> edges;
  vector<vector<long long> > adj;
  long long n, m = 0;
  long long s, t;
  vector<long long> level, ptr;
  queue<long long> q;
  dinic(long long n, long long s, long long t) : n(n), s(s), t(t) {
    adj.resize(n);
    level.resize(n);
    ptr.resize(n);
  }
  void add_edge(long long v, long long u, long long 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()) {
      long long v = q.front();
      q.pop();
      for (long long id : adj[v]) {
        if (edges[id].cap - edges[id].flow < 1) continue;
        if (level[edges[id].u] != -1) continue;
        level[edges[id].u] = level[v] + 1;
        q.push(edges[id].u);
      }
    }
    return level[t] != -1;
  }
  long long dfs(long long v, long long pushed) {
    if (pushed == 0) return 0;
    if (v == t) return pushed;
    for (long long& cid = ptr[v]; cid < (long long)adj[v].size(); cid++) {
      long long id = adj[v][cid];
      long long u = edges[id].u;
      if (level[v] + 1 != level[u] || edges[id].cap - edges[id].flow < 1)
        continue;
      long long tr = dfs(u, min(pushed, edges[id].cap - edges[id].flow));
      if (tr == 0) continue;
      edges[id].flow += tr;
      edges[id ^ 1].flow -= tr;
      return tr;
    }
    return 0;
  }
  long long flow() {
    long long 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 pushed = dfs(s, flow_inf)) f += pushed;
    }
    return f;
  }
};
long long n, t;
char a[N][N], b[N][N];
long long distr[N][N];
long long dx[4] = {-1, 1, 0, 0}, dy[4] = {0, 0, -1, 1};
int main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  cin >> n >> t;
  queue<pair<long long, long long> > q;
  dinic d(n * n * 2 + 3, 1, n * n * 2 + 2);
  for (long long i = 0; i < n; i++)
    for (long long j = 0; j < n; j++) {
      distr[i][j] = -1;
      cin >> a[i][j];
      if (a[i][j] == 'Z') {
        q.push(make_pair(i, j));
        distr[i][j] = 0;
      }
      if (isdigit(a[i][j])) d.add_edge(1, (i * n) + j + 2, a[i][j] - '0');
    }
  for (long long i = 0; i < n; i++)
    for (long long j = 0; j < n; j++) {
      cin >> b[i][j];
      if (isdigit(b[i][j]))
        d.add_edge(n * n + (i * n) + j + 2, n * n * 2 + 2, b[i][j] - '0');
    }
  while (!q.empty()) {
    auto cxy = q.front();
    q.pop();
    long long x = cxy.first, y = cxy.second;
    for (long long mv = 0; mv < 4; mv++) {
      long long cx = x + dx[mv], cy = y + dy[mv];
      if (cx >= 0 && cx < n && cy >= 0 && cy < n && distr[cx][cy] == -1 &&
          isdigit(a[cx][cy])) {
        distr[cx][cy] = distr[x][y] + 1;
        q.push(make_pair(cx, cy));
      }
    }
  }
  for (long long i = 0; i < n; i++)
    for (long long j = 0; j < n; j++) {
      if (distr[i][j] == -1)
        distr[i][j] = t;
      else
        distr[i][j] = min(distr[i][j], t);
    }
  for (long long i = 0; i < n; i++)
    for (long long j = 0; j < n; j++) {
      if (!isdigit(a[i][j])) continue;
      vector<vector<long long> > dist(n, vector<long long>(n, -1));
      q.push(make_pair(i, j));
      dist[i][j] = 0;
      while (!q.empty()) {
        auto cxy = q.front();
        q.pop();
        long long x = cxy.first, y = cxy.second;
        for (long long mv = 0; mv < 4; mv++) {
          long long cx = x + dx[mv], cy = y + dy[mv];
          if (cx >= 0 && cx < n && cy >= 0 && cy < n && isdigit(a[cx][cy]) &&
              dist[cx][cy] == -1) {
            dist[cx][cy] = dist[x][y] + 1;
            q.push(make_pair(cx, cy));
          }
        }
      }
      for (long long k = 0; k < n; k++)
        for (long long l = 0; l < n; l++) {
          if (i == k && j == l)
            d.add_edge((i * n) + j + 2, n * n + (k * n) + l + 2, 1e9 + 42);
          else {
            if (dist[k][l] == -1) continue;
            if (dist[k][l] > distr[k][l]) continue;
            char ok = false;
            for (long long mv = 0; mv < 4; mv++) {
              long long cx = k + dx[mv], cy = l + dy[mv];
              if (cx >= 0 && cx < n && cy >= 0 && cy < n && isdigit(a[cx][cy]))
                if (distr[cx][cy] > dist[cx][cy]) ok = true;
            }
            if (ok)
              d.add_edge((i * n) + j + 2, n * n + (k * n) + l + 2, 1e9 + 42);
          }
        }
    }
  cout << d.flow();
  return 0;
}
