#include<iostream>
#include<cstdio>
#include<algorithm>
#include<cstring>
#include<queue>
#include<functional>
#include<utility>
#include<cmath>

using namespace std;
const int MAXN = 502;	//最大节点
const int MAXM = 1100000; //边的最大值
const int INF = 0x3f3f3f3f;

char map[MAXN][MAXN];	//保存地图	
pair<int, int> dis[MAXN][MAXN];	//用于最短路的长度（pair->first是伤害，second是距离）
int n, m;
int sx, sy, dx, dy;
int dir[4][2] = { -1, 0, 1, 0, 0, -1, 0, 1 };


struct Edge
{
	int vx, vy;
	int bl, dis;
	int next;
}; //边结构


struct node
{
	int x, y, b, d;

	node( int x, int y, int b, int d )
	{
		this->x = x;
		this->y = y;
		this->b = b;
		this->d = d;
	}
}; //节点状态结构


class cmp
{
public:
	bool operator() ( const node& lhs, const node& rhs )
	{
		if(lhs.b != rhs.b) return lhs.b > rhs.b;
		return lhs.d > rhs.d;
	}
};

int head[MAXN][MAXN];
Edge edge[MAXM];
int cnt = 0;

void addedge( int ux, int uy, int vx, int vy, int bl, int dis )
{
	edge[cnt].vx = vx;
	edge[cnt].vy = vy;
	edge[cnt].bl = bl;
	edge[cnt].dis = dis;
	edge[cnt].next = head[ux][uy];
	head[ux][uy] = cnt++;
}//邻接表的数组实现

void ini( )
{
	memset( map, '#', sizeof map );
	memset( head, -1, sizeof head );
	cnt = 0;

	scanf( "%d%d", &n, &m );
	scanf( "%d%d%d%d", &sx, &sy, &dx, &dy );
	for(int i = 1; i <= n; i++)
		scanf( "%s", map[i] + 1 );
}//初始化函数	

bool check( int x, int y )
{
	if(x <= 0 || y <= 0 || x > n || y > m || map[x][y] == '#')return false;
	return true;
}//看看是否可以走到这个格子

void SPFA( )	//最短路算法，Dijkstra要超时
{
	priority_queue<node, vector<node>, cmp> q;
	q.push( node( sx, sy, 0, 0 ) );
	memset( dis, 0x7f, sizeof dis );
	dis[sx][sy] = make_pair( 0, 0 );

	while(!q.empty( ))
	{
		
		int x = q.top( ).x;
		int y = q.top( ).y;
		if((x == dx) && (y == dy)) break;
		q.pop( );

		for(int i = head[x][y]; i != -1; i = edge[i].next)
		{
			int vx = edge[i].vx;
			int vy = edge[i].vy;
			int temb = edge[i].bl;
			int temd = edge[i].dis;

			if(islower( map[vx][vy] )) temb += map[vx][vy] - 'a' + 1;
			if((dis[vx][vy].first > dis[x][y].first + temb) || (dis[vx][vy].first == dis[x][y].first + temb&&dis[vx][vy].second > dis[x][y].second + temd))
			{
				dis[vx][vy].first = dis[x][y].first + temb;
				dis[vx][vy].second = dis[x][y].second + temd;
				q.push( node( vx, vy, dis[vx][vy].first, dis[vx][vy].second ) );
			}
		}
	}

}


void create( ) //建图过程。比较复杂
{
	for(int i = 1; i <= n; i++)
	for(int j = 1; j <= m; j++)
	if(map[i][j] != '#' && !isupper( map[i][j] ))	//处理非怪物节点
	{
		for(int k1 = 0; k1 <= 3; k1++)
		{
			int x1 = i + dir[k1][0];
			int y1 = j + dir[k1][1];

			if(!check( x1, y1 ) || isupper( map[x1][y1] )) continue;
			int blood = 0;
			for(int k2 = 0; k2 <= 3; k2++)
			{
				int x2 = x1 + dir[k2][0];
				int y2 = y1 + dir[k2][1];
				if(!check( x2, y2 )) continue;

				if(isupper( map[x2][y2] ))
				{
					blood += map[x2][y2] - 'A' + 1;
				}
			}
			addedge( i, j, x1, y1, blood, 1 );

		}

	}

	//怪物节点特殊处理
	for(int i = 1; i <= n; i++)
	for(int j = 1; j <= m; j++)
	if(isupper( map[i][j] ))
	{
		for(int k1 = 0; k1 <= 3; k1++)
		{
			int x1 = i + dir[k1][0];
			int y1 = j + dir[k1][1];
			if(!check( x1, y1 ))continue;

			for(int k2 = 0; k2 <= 3; k2++) if(k2 != k1)
			{
				int x2 = i + dir[k2][0];
				int y2 = j + dir[k2][1];
				int blood = 0;
				if(!check( x2, y2 ))continue;
				for(int k3 = 0; k3 <= 3; k3++)
				{
					int x3 = x2 + dir[k3][0];
					int y3 = y2 + dir[k3][1];
					if(!check( x3, y3 ) || abs( x3 - x1 ) + abs( y3 - y1 ) <= 1) continue;
					if(isupper( map[x3][y3] ))	blood += map[x3][y3] - 'A' + 1;
				}
				addedge( x1, y1, x2, y2, blood, 2 );
			}
		}
	}
}

int main( )
{

	int kase;
	scanf( "%d", &kase );
	while(kase--)
	{
		ini( );
		create( );
		SPFA( );
		printf( "%d %d\n", dis[dx][dy].first, dis[dx][dy].second );

	}
	return 0;
}