#include <bits/stdc++.h>
using namespace std;
int dx[] = {1, -1, 0, 0};
int dy[] = {0, 0, 1, -1};
struct FlowEdge {
  int v, u;
  long long cap, flow = 0;
  FlowEdge(int v, int u, long long cap) : v(v), u(u), cap(cap) {}
};
struct Dinic {
  const long long 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_edge(int v, int 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()) {
      int v = q.front();
      q.pop();
      for (int 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(int v, long long pushed) {
    if (pushed == 0) return 0;
    if (v == t) return pushed;
    for (int& cid = ptr[v]; cid < (int)adj[v].size(); cid++) {
      int id = adj[v][cid];
      int 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;
  }
};
int n, t;
string sci[15];
string cap[15];
int dis[15][15];
int dis2[15][15];
bool isvalid(int x, int y) {
  if (x < 0 || y < 0 || x >= n || y >= n) return false;
  if (sci[x][y] == 'Y' || sci[x][y] == 'Z') return false;
  return true;
}
void bfs1(int x, int y) {
  queue<pair<int, int>> q;
  q.push({x, y});
  memset(dis, -1, sizeof dis);
  dis[x][y] = 0;
  while (!q.empty()) {
    pair<int, int> u = q.front();
    q.pop();
    for (int i = 0; i < 4; i++) {
      int vx = u.first + dx[i];
      int vy = u.second + dy[i];
      if (isvalid(vx, vy) && dis[vx][vy] == -1) {
        dis[vx][vy] = 1 + dis[u.first][u.second];
        q.push({vx, vy});
      }
    }
  }
  for (int i = 0; i < n; i++) {
    for (int j = 0; j < n; j++) {
      if (dis[i][j] == -1) dis[i][j] = 1000000000;
    }
  }
}
int dp[65][12][12][12][12];
int pos(int tt, int x0, int y0, int x, int y) {
  if (dis[x0][y0] < tt) return 0;
  if (x0 == x and y0 == y) return 1;
  if (tt >= t) return 0;
  if (dis[x0][y0] <= tt) return 0;
  if (dp[tt][x0][y0][x][y] != -1) return dp[tt][x0][y0][x][y];
  for (int j = 0; j < 4; j++) {
    int xx = x0 + dx[j];
    int yy = y0 + dy[j];
    if (xx < 0 or xx >= n) continue;
    if (yy < 0 or yy >= n) continue;
    if (sci[xx][yy] == 'Y') continue;
    if (sci[xx][yy] == 'Z') continue;
    if (pos(tt + 1, xx, yy, x, y)) return dp[tt][x0][y0][x][y] = 1;
  }
  return dp[tt][x0][y0][x][y] = 0;
}
int main() {
  memset(dp, -1, sizeof dp);
  cin >> n >> t;
  for (int i = 0; i < n; i++) {
    cin >> sci[i];
  }
  for (int i = 0; i < n; i++) {
    cin >> cap[i];
  }
  for (int i = 0; i < n; i++) {
    for (int j = 0; j < n; j++) {
      if (sci[i][j] == 'Z') {
        bfs1(i, j);
        break;
      }
    }
  }
  vector<pair<int, int>> sc, cp;
  for (int i = 0; i < n; i++) {
    for (int j = 0; j < n; j++) {
      if (sci[i][j] != 'Z' && sci[i][j] != 'Y' && sci[i][j] != '0') {
        sc.push_back({i, j});
      }
    }
  }
  for (int i = 0; i < n; i++) {
    for (int j = 0; j < n; j++) {
      if (cap[i][j] != 'Z' && cap[i][j] != 'Y' && cap[i][j] != '0') {
        cp.push_back({i, j});
      }
    }
  }
  Dinic flow(sc.size() + cp.size() + 2, 0, sc.size() + cp.size() + 1);
  for (int i = 0; i < sc.size(); i++) {
    long long c = sci[sc[i].first][sc[i].second] - '0';
    flow.add_edge(0, i + 1, c);
  }
  for (int i = 0; i < cp.size(); i++) {
    long long c = cap[cp[i].first][cp[i].second] - '0';
    flow.add_edge(sc.size() + 1 + i, sc.size() + cp.size() + 1, c);
  }
  for (int i = 0; i < sc.size(); i++) {
    for (int j = 0; j < cp.size(); j++) {
      if (pos(0, sc[i].first, sc[i].second, cp[j].first, cp[j].second)) {
        flow.add_edge(i + 1, sc.size() + 1 + j, 10000000);
      }
    }
  }
  cout << flow.flow() << '\n';
}
