The Berland's capital has the form of a rectangle with sizes n × m quarters. All quarters are divided into three types:

  * regular (labeled with the character '.') — such quarters do not produce the noise but are not obstacles to the propagation of the noise; 
  * sources of noise (labeled with an uppercase Latin letter from 'A' to 'Z') — such quarters are noise sources and are not obstacles to the propagation of the noise; 
  * heavily built-up (labeled with the character '*') — such quarters are soundproofed, the noise does not penetrate into them and they themselves are obstacles to the propagation of noise. 



A quarter labeled with letter 'A' produces q units of noise. A quarter labeled with letter 'B' produces 2·q units of noise. And so on, up to a quarter labeled with letter 'Z', which produces 26·q units of noise. There can be any number of quarters labeled with each letter in the city.

When propagating from the source of the noise, the noise level is halved when moving from one quarter to a quarter that shares a side with it (when an odd number is to be halved, it's rounded down). The noise spreads along the chain. For example, if some quarter is located at a distance 2 from the noise source, then the value of noise which will reach the quarter is divided by 4. So the noise level that comes from the source to the quarter is determined solely by the length of the shortest path between them. Heavily built-up quarters are obstacles, the noise does not penetrate into them.

<image> The values in the cells of the table on the right show the total noise level in the respective quarters for q = 100, the first term in each sum is the noise from the quarter 'A', the second — the noise from the quarter 'B'.

The noise level in quarter is defined as the sum of the noise from all sources. To assess the quality of life of the population of the capital of Berland, it is required to find the number of quarters whose noise level exceeds the allowed level p.

Input

The first line contains four integers n, m, q and p (1 ≤ n, m ≤ 250, 1 ≤ q, p ≤ 106) — the sizes of Berland's capital, the number of noise units that a quarter 'A' produces, and the allowable noise level.

Each of the following n lines contains m characters — the description of the capital quarters, in the format that was described in the statement above. It is possible that in the Berland's capital there are no quarters of any type.

Output

Print the number of quarters, in which the noise level exceeds the allowed level p.

Examples

Input

3 3 100 140
...
A*.
.B.


Output

3


Input

3 3 2 8
B*.
BB*
BBB


Output

4


Input

3 4 5 4
..*B
..**
D...


Output

7

Note

The illustration to the first example is in the main part of the statement.
#include <bits/stdc++.h>
using namespace std;
int dx[4] = {0, -1, 0, 1};
int dy[4] = {-1, 0, 1, 0};
int m, n, q, p, visit[300][300], val[300][300], A[300][300];
long long B[300][300];
void BFS(int s, int t, int cnt) {
  queue<pair<int, int> > que;
  que.push(make_pair(s, t));
  B[s][t] += A[s][t];
  val[s][t] = A[s][t];
  visit[s][t] = cnt;
  while (!que.empty()) {
    int u = que.front().first, v = que.front().second;
    que.pop();
    for (int i = 0; i < 4; i++) {
      int x = u + dx[i];
      int y = v + dy[i];
      if (x <= 0 || x > m || y <= 0 || y > n) {
        continue;
      }
      if (A[x][y] == -1 || visit[x][y] == cnt) {
        continue;
      }
      visit[x][y] = cnt;
      val[x][y] = val[u][v] / 2;
      B[x][y] += val[x][y];
      if (val[x][y] > 0) {
        que.push(make_pair(x, y));
      }
    }
  }
}
int main() {
  cin >> m >> n >> q >> p;
  for (int i = 1; i <= m; i++) {
    string st;
    cin >> st;
    for (int j = 1; j <= n; j++) {
      if (st[j - 1] == '.') {
        A[i][j] = 0;
      } else if (st[j - 1] == '*') {
        A[i][j] = -1;
      } else {
        A[i][j] = (st[j - 1] - 'A' + 1) * q;
      }
    }
  }
  memset(B, 0, sizeof(B));
  memset(visit, 0, sizeof(visit));
  int cnt = 0;
  for (int i = 1; i <= m; i++) {
    for (int j = 1; j <= n; j++) {
      if (A[i][j] > 0) {
        BFS(i, j, ++cnt);
      }
    }
  }
  int res = 0;
  for (int i = 1; i <= m; i++) {
    for (int j = 1; j <= n; j++) {
      if (B[i][j] > p) {
        res++;
      }
    }
  }
  cout << res << endl;
  return 0;
}
