#include<bits/stdc++.h>
#define fo(i,a,b) for (int (i)=(a);(i)<=(b);(i)++)
#define fd(i,b,a) for (int (i)=(b);(i)>=(a);(i)--)
#define mk(x,y) make_pair((x),(y))
#define ll long long
using namespace std;
const int N = 1e6 + 100;
#define int long long

char a[260][260];
ll x[260], y[260];



signed main() {
    #ifdef LOCAL
    freopen("in.txt", "r", stdin);
    freopen("out.txt", "w", stdout);
#endif
    ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
    ll n, m, c, d;
    cin >> n >> m >> c >> d;
    for (int i = 0;i < n;i++)
    {
        for (int j = 0;j < m;j++)
        {
            cin >> a[i][j];
            if (a[i][j] == '.')
            {
                x[i]++;
                y[j]++;
            }
        }
    }
    ll ans, tmp;
    ll answer = 1e18;
    
    for (int i = 0;i <= max(n, m);i++)
    {
        ans = 0;
        tmp = i * c;
        for (int j = 0;j < n;j++)
        {
            //cout << x[j] << " ";
            tmp += max(1ll*0, x[j] - i) * d;
        }
        //cout << tmp << '\n';
        ans = max(ans, tmp);

        tmp = i * c;
        for (int j = 0;j < m;j++)
        {
            tmp += max(1ll*0, y[j] - i) * d;
            //cout << y[j] << " ";
        }
        //cout << tmp << '\n';
        ans = max(ans, tmp);
        answer = min(answer, ans);
    }
    cout << answer;
    return 0;
}