#include<bits/stdc++.h>
using namespace std;
#ifdef DEBUG
#include"debug.h"
#else
#define debug(...) void()
#endif
#define all(x) (x).begin(),(x).end()
template<class T>
auto ary(T *a,int l,int r){
	return vector<T>{a+l,a+1+r};
}
using ll=long long;
using ull=unsigned long long;
const int N=1e4+10,M=23;
const int dx[4]={-1,1,0,0};
const int dy[4]={0,0,-1,1};
const double eps=1e-9;
int n,m,cnt,p[4],id[N][M],s[N][M];
char a[N][M];
double buf[N*M][M*3],ans[N*M];
double& f(int x,int y){
	return buf[x][y-max(1,x-m)];
}
void gauss(){
	for(int i=1;i<=cnt;i++){
		int p=min(i+m,cnt),q=min(i+m*2,cnt);
		if([&](){
			int j=i;
			for(;j<=p&&abs(f(j,i))<eps;j++);
			if(j>p)return 1;
			for(int k=i;k<=q;k++)swap(f(i,k),f(j,k));
			return 0;
		}())continue;
		for(int j=i+1;j<=p;j++){
			double w=f(j,i)/f(i,i);
			for(int k=q;k>=i;k--)f(j,k)-=w*f(i,k);
			ans[j]-=w*ans[i];
		}
	}
	for(int i=cnt;i>=1;i--)if(abs(f(i,i))>eps){
		int q=min(i+m*2,cnt);
		for(int j=i+1;j<=q;j++)ans[i]-=f(i,j)*ans[j];
		ans[i]/=f(i,i);
	}
}
int main(){
	scanf("%d%d",&m,&n);
	for(int i=0;i<4;i++)scanf("%d",&p[i]);
	for(int i=1;i<=n;i++)scanf("%s",a[i]+1);
	for(int i=1;i<=n;i++)for(int j=1;j<=m;j++){
		if(a[i][j]=='X')continue;
		id[i][j]=++cnt;
		for(int k=0;k<4;k++){
			int x=i+dx[k],y=j+dy[k];
			if(x<1||x>n||y<1||y>m||a[x][y]=='X')continue;
			s[i][j]+=p[k];
		}
	}
	for(int i=1;i<=n;i++)for(int j=1;j<=m;j++){
		if(a[i][j]=='X')continue;
		f(id[i][j],id[i][j])=1;
		for(int k=0;k<4;k++){
			int x=i+dx[k],y=j+dy[k];
			if(x<1||x>n||y<1||y>m||a[x][y]!='.')continue;
			f(id[i][j],id[x][y])=-(double)p[k^1]/s[x][y];
		}
	}
	int tot=count(a[1]+1,a[1]+1+m,'.');
	for(int j=1;j<=m;j++)if(a[1][j]=='.')ans[id[1][j]]=(double)1/tot;
	gauss();
	for(int i=1;i<=n;i++){
		for(int j=1;j<=m;j++){
			if(a[i][j]=='T')printf("%.15lf\n",ans[id[i][j]]);
		}
	}
	return 0;
}
#ifdef DEBUG
#include"debug.hpp"
#endif