Problem: They've screwed something up yet again... In one nuclear reactor of a research station an uncontrolled reaction is in progress and explosion which will destroy the whole station will happen soon.

The station is represented by a square n × n divided into 1 × 1 blocks. Each block is either a reactor or a laboratory. There can be several reactors and exactly one of them will explode soon. The reactors can be considered impassable blocks, but one can move through laboratories. Between any two laboratories, which are in adjacent blocks, there is a corridor. Blocks are considered adjacent if they have a common edge.

In each laboratory there is some number of scientists and some number of rescue capsules. Once the scientist climbs into a capsule, he is considered to be saved. Each capsule has room for not more than one scientist.

The reactor, which is about to explode, is damaged and a toxic coolant trickles from it into the neighboring blocks. The block, which contains the reactor, is considered infected. Every minute the coolant spreads over the laboratories through corridors. If at some moment one of the blocks is infected, then the next minute all the neighboring laboratories also become infected. Once a lab is infected, all the scientists there that are not in rescue capsules die. The coolant does not spread through reactor blocks.

There are exactly t minutes to the explosion. Any scientist in a minute can move down the corridor to the next lab, if it is not infected. On any corridor an unlimited number of scientists can simultaneously move in both directions. It is believed that the scientists inside a lab moves without consuming time. Moreover, any scientist could get into the rescue capsule instantly. It is also believed that any scientist at any given moment always has the time to perform their actions (move from the given laboratory into the next one, or climb into the rescue capsule) before the laboratory will be infected.

Find the maximum number of scientists who will be able to escape.

Input

The first line contains two integers n and t (2 ≤ n ≤ 10, 1 ≤ t ≤ 60). Each of the next n lines contains n characters. These lines describe the scientists' locations. Then exactly one empty line follows. Each of the next n more lines contains n characters. These lines describe the rescue capsules' locations.

In the description of the scientists' and the rescue capsules' locations the character "Y" stands for a properly functioning reactor, "Z" stands for the malfunctioning reactor. The reactors' positions in both descriptions coincide. There is exactly one malfunctioning reactor on the station. The digits "0" - "9" stand for the laboratories. In the description of the scientists' locations those numbers stand for the number of scientists in the corresponding laboratories. In the rescue capsules' descriptions they stand for the number of such capsules in each laboratory.

Output

Print a single number — the maximum number of scientists who will manage to save themselves.

Examples

Input

3 3
1YZ
1YY
100

0YZ
0YY
003


Output

2

Input

4 4
Y110
1Y1Z
1Y0Y
0100

Y001
0Y0Z
0Y0Y
0005


Output

3

Note

In the second sample the events could take place as follows: 

<image>

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
#pragma comment(linker, "/STACK:102400000,102400000")
using namespace std;
const int maxn = 300 + 10, maxm = 4e4 + 10;
const int dir[4][2] = {0, 1, 0, -1, 1, 0, -1, 0};
const int INF = 0x3f3f3f3f;
struct Graph {
  int ndn, edn, last[maxn];
  int u[maxm], v[maxm], flw[maxm], cap[maxm], nxt[maxm];
  void init(int _n) {
    ndn = _n;
    edn = 0;
    memset(last, -1, sizeof(last));
    memset(flw, 0, sizeof(flw));
    memset(cap, 0, sizeof(cap));
  }
  void adde(int _u, int _v, int _c) {
    u[edn] = _u;
    v[edn] = _v;
    cap[edn] = _c;
    nxt[edn] = last[_u];
    last[_u] = edn++;
  }
};
struct Dinic {
  Graph *G;
  int S, T, dist[maxn], cur[maxn];
  int BFS();
  int DFS(int, int);
  int solve(Graph *, int, int);
};
int N, T;
char sci[15][15], cap[15][15];
int death[15][15], idsci[15][15], idcap[15][15];
int dist[15][15];
Graph G;
Dinic dinic;
bool judge(int x, int y) {
  return x < 0 || x >= N || y < 0 || y >= N || !isdigit(sci[x][y]);
}
int main() {
  int zx, zy;
  G.init(1);
  scanf("%d%d", &N, &T);
  for (int i = 0; i < N; i++) {
    scanf(" %s", sci[i]);
    for (int j = 0; j < N; j++) {
      if (isdigit(sci[i][j]) && sci[i][j] >= '1') {
        idsci[i][j] = ++G.ndn;
        G.adde(0, G.ndn, sci[i][j] - '0');
        G.adde(G.ndn, 0, 0);
      }
      if (sci[i][j] == 'Z') {
        zx = i;
        zy = j;
      }
    }
  }
  for (int i = 0; i < N; i++) {
    scanf(" %s", cap[i]);
    for (int j = 0; j < N; j++) {
      if (isdigit(cap[i][j]) && cap[i][j] >= '1') {
        idcap[i][j] = ++G.ndn;
        G.adde(G.ndn, 1, cap[i][j] - '0');
        G.adde(1, G.ndn, 0);
      }
    }
  }
  queue<pair<int, int> > que;
  memset(death, 0x3f, sizeof(death));
  death[zx][zy] = 0;
  que.push({zx, zy});
  while (que.size()) {
    pair<int, int> u = que.front();
    que.pop();
    int d = death[u.first][u.second] + 1;
    for (int k = 0; k < 4; k++) {
      int x = u.first + dir[k][0];
      int y = u.second + dir[k][1];
      if (judge(x, y) || death[x][y] < INF) continue;
      death[x][y] = d;
      que.push({x, y});
    }
  }
  for (int i = 0; i < N; i++)
    for (int j = 0; j < N; j++)
      if (isdigit(sci[i][j]) && sci[i][j] >= '1') {
        while (que.size()) que.pop();
        memset(dist, 0x3f, sizeof(dist));
        dist[i][j] = 0;
        que.push({i, j});
        while (que.size()) {
          pair<int, int> u = que.front();
          que.pop();
          if (idcap[u.first][u.second]) {
            G.adde(idsci[i][j], idcap[u.first][u.second], sci[i][j] - '0');
            G.adde(idcap[u.first][u.second], idsci[i][j], 0);
          }
          int d = dist[u.first][u.second] + 1;
          if (d > T || dist[u.first][u.second] >= death[u.first][u.second])
            continue;
          for (int k = 0; k < 4; k++) {
            int x = u.first + dir[k][0];
            int y = u.second + dir[k][1];
            if (judge(x, y) || dist[x][y] < INF || death[x][y] < d) continue;
            dist[x][y] = d;
            que.push({x, y});
          }
        }
      }
  printf("%d\n", dinic.solve(&G, 0, 1));
  return 0;
}
int Dinic::solve(Graph *g, int ts, int tt) {
  G = g;
  S = ts;
  T = tt;
  int res = 0;
  while (BFS()) {
    for (int i = 0; i <= G->ndn; i++) cur[i] = G->last[i];
    res += DFS(S, 1e9);
  }
  return res;
}
int Dinic::BFS() {
  memset(dist, -1, sizeof(dist));
  dist[S] = 0;
  queue<int> que;
  que.push(S);
  while (que.size()) {
    int u = que.front();
    que.pop();
    for (int e = G->last[u]; ~e; e = G->nxt[e]) {
      int v = G->v[e];
      if (dist[v] == -1 && G->cap[e] > G->flw[e]) {
        dist[v] = dist[u] + 1;
        que.push(v);
      }
    }
  }
  return ~dist[T];
}
int Dinic::DFS(int u, int tmin) {
  if (u == T || tmin == 0) return tmin;
  int nflw = 0, f;
  for (int &e = cur[u]; ~e; e = G->nxt[e]) {
    int v = G->v[e];
    if (dist[u] + 1 == dist[v] &&
        (f = DFS(v, min(tmin, G->cap[e] - G->flw[e]))) > 0) {
      G->flw[e] += f;
      G->flw[e ^ 1] -= f;
      nflw += f;
      tmin -= f;
      if (tmin == 0) break;
    }
  }
  return nflw;
}