#include <bits/stdc++.h>
using namespace std;
//#pragma GCC optimize(3)
#define DB double
#define LL long long
#define ULL unsigned long long
#define in128 __int128
#define cint const int
#define cLL const LL
#define For(z,e1,e2) for(int z=(e1);z<=(e2);z++)
#define Rof(z,e1,e2) for(int z=(e2);z>=(e1);z--)
#define For_(z,e1,e2) for(int z=(e1);z<(e2);z++)
#define Rof_(z,e1,e2) for(int z=(e2);z>(e1);z--)
#define inint(e) scanf("%d",&e)
#define inll(e) scanf("%lld",&e)
#define inpr(e1,e2) scanf("%d%d",&e1,&e2)
#define in3(e1,e2,e3) scanf("%d%d%d",&e1,&e2,&e3)
#define outint(e) printf("%d\n",e)
#define outint_(e) printf("%d%c",e," \n"[i==n])
#define outint2_(e,e1,e2) printf("%d%c",e," \n"[(e1)==(e2)])
#define outll(e) printf("%lld\n",e)
#define outll_(e) printf("%lld%c",e," \n"[i==n])
#define outll2_(e,e1,e2) printf("%lld%c",e," \n"[(e1)==(e2)])
#define exc(e) if(e) continue
#define stop(e) if(e) break
#define ret(e) if(e) return
#define ll(e) (1ll*(e))
#define pb push_back
#define ft first
#define sc second
#define clean(e) while(!e.empty()) e.pop()
#define all(ev) ev.begin(),ev.end()
#define sz(ev) ((int)ev.size())
#define debug(x) printf("%s=%d\n",#x,x)
#define x0 __xx00__
#define y1 __yy11__
#define ffo fflush(stdout)
cLL mod=998244353,G=404;
template <typename Type> void get_min(Type &w1,const Type w2) { if(w2<w1) w1=w2; } template <typename Type> void get_max(Type &w1,const Type w2) { if(w2>w1) w1=w2; }
template <typename Type> Type up_div(Type w1,Type w2) { return (w1/w2+(w1%w2?1:0)); }
template <typename Type> Type gcd(Type X_,Type Y_) { Type R_=X_%Y_; while(R_) { X_=Y_; Y_=R_; R_=X_%Y_; } return Y_; } template <typename Type> Type lcm(Type X_,Type Y_) { return (X_/gcd(X_,Y_)*Y_); }
template <typename Type> Type md(Type w1,const Type w2=mod) { w1%=w2; if(w1<0) w1+=w2; return w1; } template <typename Type> Type md_(Type w1,const Type w2=mod) { w1%=w2; if(w1<=0) w1+=w2; return w1; }
void ex_gcd(LL &X_,LL &Y_,LL A_,LL B_) { if(!B_) { X_=1ll; Y_=0ll; return ; } ex_gcd(Y_,X_,B_,A_%B_); X_=md(X_,B_); Y_=(1ll-X_*A_)/B_; } LL inv(LL A_,LL B_=mod) { LL X_=0ll,Y_=0ll; ex_gcd(X_,Y_,A_,B_); return X_; }
template <typename Type> void add(Type &w1,const Type w2,const Type M_=mod) { w1=md(w1+w2,M_); } void mul(LL &w1,cLL w2,cLL M_=mod) { w1=md(w1*md(w2,M_),M_); } template <typename Type> Type pw(Type X_,Type Y_,Type M_=mod) { Type S_=1; while(Y_) { if(Y_&1) mul(S_,X_,M_); Y_>>=1; mul(X_,X_,M_); } return S_; }
template <typename Type> Type bk(vector <Type> &V_) { auto T_=V_.back(); V_.pop_back(); return T_; } template <typename Type> Type tp(stack <Type> &V_) { auto T_=V_.top(); V_.pop(); return T_; } template <typename Type> Type frt(queue <Type> &V_) { auto T_=V_.front(); V_.pop(); return T_; }
template <typename Type> Type bg(set <Type> &V_) { auto T_=*V_.begin(); V_.erase(V_.begin()); return T_; } template <typename Type> Type bk(set <Type> &V_) { auto T_=*prev(V_.end()); V_.erase(*prev(V_.end())); return T_; }
mt19937 gen(time(NULL)); int rd() { return abs((int)gen()); }
cint L=43,N=L*L*4,M=L*L*12;
int n,m;
int d1,d2;
int br[L][L],bc[L][L],wr[L][L],wc[L][L];
char sr[L];
vector <pair<int,int> > v[N];
cint inf=1e9;
int w[M<<1];
void bld(int x,int y,int lw)
{
    w[(++m)<<1]=lw;
    v[x].pb({y,m<<1});
    v[y].pb({x,m<<1|1});
}
int dis[N],now[N];
queue <int> q;
bool bfs()
{
    memset(now,0,sizeof(int)*(n+1));
    memset(dis,0xff,sizeof(int)*(n+1));
    clean(q); q.push(0); dis[0]=0;
    while(!q.empty())
    {
        int p=q.front(); q.pop();
        for(auto [i,id]:v[p])
        {
            exc(!w[id]||~dis[i]);
            dis[i]=dis[p]+1;
            q.push(i);
        }
    }
    return (~dis[1]);
}
int dfs(int p,int f)
{
    if(p==1) return f;
    int len=sz(v[p]),s=0;
    for(int i_=now[p]++;i_<len&&f;now[p]=(++i_)+1)
    {
        auto [i,id]=v[p][i_];
        exc(!w[id]||dis[i]!=dis[p]+1);
        int d=dfs(i,min(f,w[id]));
        s+=d,f-=d,w[id]-=d,w[id^1]+=d;
    }
    return s;
}
int dinic()
{
    int ans=0;
    while(bfs()) ans+=dfs(0,inf);
    return ans;
}
void main_solve()
{
    inpr(d1,d2);
    int ck,cb,c; in3(ck,cb,c);
    n=1,m=0;
    For(i,1,d1) For(j,1,d2)
    {
        bld(0,br[i][j]=++n,ck),bld(bc[i][j]=++n,1,ck);
        bld(0,wc[i][j]=++n,ck),bld(wr[i][j]=++n,1,ck);
        if(i>1)
        {
            bld(br[i][j],br[i-1][j],cb);
            bld(wr[i-1][j],wr[i][j],cb);
        }
        if(i==d1)
        {
            bld(0,br[i][j],cb);
            bld(wr[i][j],1,cb);
        }
        if(j>1)
        {
            bld(wc[i][j],wc[i][j-1],cb);
            bld(bc[i][j-1],bc[i][j],cb);
        }
        if(j==d2)
        {
            bld(0,wc[i][j],cb);
            bld(bc[i][j],1,cb);
        }
    }
    For(i,1,d1)
    {
        scanf("%s",sr+1);
        For(j,1,d2)
        {
            if(sr[j]=='#')
            {
                bld(br[i][j],bc[i][j],c);
                bld(0,wc[i][j],inf);
                bld(wr[i][j],1,inf);
            }
            else
            {
                bld(wc[i][j],br[i][j],c);
                bld(bc[i][j],wr[i][j],c);
                bld(bc[i][j],br[i][j],inf);
            }
        }
    }
    outint(dinic());
}
int main()
{
    // ios::sync_with_stdio(0); cin.tie(0);
    // freopen("in.txt","r",stdin);
    // freopen("out1.txt","w",stdout);
    // srand(time(NULL));
    // main_init();
    // int _; inint(_); For(__,1,_) // T>1 ?
        // printf("\n------------\n\n"),
        main_solve();
    return 0;
}
/*

*/