#include <stdio.h>

#define MAX 150

#define HILL     'k'
#define SWAMP    't'
#define ROAD     '.'
#define FOREST   's'
#define GRASS    'g'

const int dx[4]={0,0,1,-1};
const int dy[4]={1,-1,0,0};

int penalty(char c)
{
	switch (c) {		
		case GRASS : return 1;
		case FOREST : return 2;
		case HILL : return 3;
		case SWAMP : return 4;
	}
	return 0;
}

int main(void)
{
	int i,j,d,best,cur,n,nx,ny,src,dest;
	int xsize,ysize,size;
	char map[MAX][MAX+1];
	int dist[MAX*MAX],pre[MAX][MAX],visited[MAX*MAX];
	
	scanf("%d %d",&xsize,&ysize);
	for(i=0;i<ysize;i++) {
		scanf("%s",map[i]);
		for(j=0;j<xsize;j++)
			switch (map[i][j]) {
				case 'B' : src=i*xsize+j; pre[i][j]=-1; break;	
				case 'V' : dest=i*xsize+j; break;
			}
	}
	size=xsize*ysize;
	memset(dist,-1,sizeof(dist));
	memset(visited,0,sizeof(visited) );
	dist[src]=0;
	while (!visited[dest]) {
		best=-1;
		for(i=0;i<size;i++)
			if ((dist[i]>=0) && !visited[i] && ((dist[i]<best) ||
(best<0))) {
				best=dist[i];
				cur=i;
			}
		visited[cur]=1;
		//printf("At %d,%d, distance %d\n",cur%xsize,cur/xsize,best);
		for(d=0;d<4;d++) {
			nx=cur%xsize+dx[d];
			ny=cur/xsize+dy[d];
			if ((nx>=0) && (ny>=0) && (nx<xsize) &&
(ny<ysize) && (map[ny][nx]!=ROAD)) {
				j=dist[cur]+penalty(map[ny][nx]);								
				n=ny*xsize+nx;
				if ((j<dist[n]) || (dist[n]<0)) {
					dist[n]=j;
					pre[ny][nx]=cur;
				}
			}
		}
	}
	cur=dest;	
	while (cur!=src) {
		nx=cur%xsize;
		ny=cur/xsize;
		if ((map[ny][nx]>='a') && (map[ny][nx]<='z'))
			map[ny][nx]-=32;
		cur=pre[ny][nx];
	}
	printf("%d\n",dist[dest]);
	/*
	for(i=0;i<ysize;i++)
		printf("%s\n",map[i]);
	*/
	return 0;
}