#include <bits/stdc++.h>
#define int long long
using namespace std;
const int maxn = 1e6+7;
const int MAXN = maxn / 2;
signed main()
{
 	ios::sync_with_stdio(false);
 	cin.tie(NULL);
 	cout.tie(NULL);
 	int r,C,n,m,cnt = 0;
 	cin >> r >> C >> n >> m;
 	char c[r][C];
 	for (int i = 0; i < r; i++)
 		for (int j = 0; j < C; j++)
 			cin >> c[i][j];
 	for (int i = 0; i < r; i++)
 	{
 		for (int j = 0; j < C; j++)
 		{
 			bool flag = true;
 			int sum = 0;
 			if (c[i][j] == 'F')
 			{
 				for (int k = 0; k < j; k++)
 				{
 					if (c[i][k] == 'M')
 					{
 						flag = false;
 						break;
					}
					sum++;
				}
				for (int k = j; k < C; k++)
 				{
 					if (c[i][k] == 'M')
 					{
 						flag = false;
 						break;
					}
					sum++;
				}
				for (int k = 0; k < j; k++)
 				{
 					if (c[k][i] == 'M')
 					{
 						flag = true;
 						break;
					}
					sum++;
				}
				for (int k = j; k < r; k++)
 				{
 					if (c[k][i] == 'M')
 					{
 						flag = true;
 						break;
					}
					sum++;
				}
				if (sum >= 3) cnt++;
			}
			if (c[i][j] == 'M')
 			{
 				for (int k = 0; k < j; k++)
 				{
 					if (c[i][k] == 'F')
 					{
 						flag = false;
 						break;
					}
					sum++;
				}
				for (int k = j; k < C; k++)
 				{
 					if (c[i][k] == 'F')
 					{
 						flag = false;
 						break;
					}
					sum++;
				}
				for (int k = 0; k < j; k++)
 				{
 					if (c[k][i] == 'F')
 					{
 						flag = true;
 						break;
					}
					sum++;
				}
				for (int k = j; k < r; k++)
 				{
 					if (c[k][i] == 'F')
 					{
 						flag = true;
 						break;
					}
					sum++;
				}
				if (sum >= 3) cnt++;
			}
		}
	}
	cout << cnt;
 	return 0;
}