#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
#define ll long long
#define pb push_back
#define emb emplace_back
#define emc emplace
#define pii pair<int,int>
#define pll pair<ll,ll>
#define F first
#define S second
template <class type_key, class type_val>
using um = unordered_map<type_key, type_val>;
template <class T>
using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
template <class T>
using ordered_multiset = tree<T, null_type, less_equal<T>, rb_tree_tag, tree_order_statistics_node_update>;
signed main(void)
{
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int n, m, d, k;
cin >> n >> m >> d >> k;
char c[n+1][m+1];
vector<vector<int>> cnt(n+1, vector<int>(m+1, 0));
vector<int> _left(n+1, 0);
for( int i = 1; i <= n; i++ ) {
for( int j = 1; j <= m; j++ ) {
cin >> c[i][j];
if( c[i][j] == 'S') {
int col = max(j - d, 1);
for( int row = max(1, i-d); row <= min(i+d,n); row++ ) {
cnt[row][col]++;
}
bool k = 0;
if( j + d + 1 > m ) k = 1;
col = min(j + d + 1, m);
for( int row = max(1, i-d); row <= min(i+d, n); row++ ) {
if( k ) _left[row]++;
else cnt[row][col]--;
}
}
}
}
int spr = 0;
int ans = 0;
for( int i = 1; i <= n; i++ ) {
for( int j = 1; j <= m; j++ ) {
spr += cnt[i][j];
if( c[i][j] == 'M') {
if( spr >= k ) ans++;
}
}
spr -= _left[i];
}
cout << ans;
return 0;
}
