#include<bits/stdc++.h>
#define ll long long
using namespace std;
int n,m,ans=0;
char c;
vector < char > a[100005];
vector < bool > vis[100005];
int dx[]={0,0,1,-1},dy[]={1,-1,0,0};
void dfs(int x,int y){
	if(a[x][y]=='S')ans+=1;
	else if(a[x][y]=='M')ans+=5;
	else if(a[x][y]=='L')ans+=10;
	for(int i=0;i<4;i++){
		int xx=x+dx[i],yy=y+dy[i];
		if(xx>=0 && xx<n && yy>=0 && yy<m && a[xx][yy]!='*' && !vis[xx][yy]){
			vis[xx][yy]=1;
			dfs(xx,yy);
		}
	}
}
int main(){
	cin>>n>>m;
	for(int i=0;i<n;i++){
		for(int j=0;j<m;j++){ 
			cin>>c;
			a[i].push_back(c);
			vis[i].push_back(0);
		}
	}
	cout<<a[0][0]<<endl;
	int xx,yy;
	cin>>xx>>yy;
	vis[xx][yy]=1;
	dfs(xx,yy);
	cout<<ans;
	return 0;
}