#include "bits/stdc++.h"
#include<unordered_map>
#include<unordered_set>
#pragma warning(disable:4996)
using namespace std;
using ld = long double;
template<class t>
using table = vector<vector<t>>;
const ld eps = 1e-9;

//// < "d:\d_download\visual studio 2015\projects\programing_contest_c++\debug\a.txt" > "d:\d_download\visual studio 2015\projects\programing_contest_c++\debug\b.txt"
  

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

int memo[22][22][22][22][10];

struct aa{
	int mx;
	int my;
	int gx;
	int gy;
	int num;
	int time;
};

class Compare {
public:
	bool operator()(const aa&l, const aa&r) {
		return l.time> r.time;
	}
};	//aa?????????????????¶


pair<int, int>amove(const vector<vector<int>>&field, const int nx, const int ny,const int move,bool gh) {

	const int nexty = ny +dy[move];
	const int nextx =nx + dx[move];
	if (gh) {

		if (field[nexty][nextx]!=2)return make_pair(nextx, nexty);
		else return make_pair(nx, ny);
	}
	else {

		if (!field[nexty][nextx])return make_pair(nextx, nexty);
		else return make_pair(nx, ny);
	}
}
int main() {
	while (1) {
		int H, W; cin >> H >> W;
		if (!H)break;
		for (int i = 0; i < 22; ++i) {
			for (int j = 0; j < 22; ++j) {
				for (int k = 0; k < 22; ++k) {
					for (int l = 0; l < 22; ++l) {
						for (int m = 0; m < 10; ++m) {
							memo[i][j][k][l][m] = 1e8;
						}
					}
				}
			}
		}
		int mx, my, gx, gy;
		vector<vector<int>>field(H + 2, vector<int>(W + 2,2));
		for (int i = 0; i < H; ++i) {
			string st; cin >> st;
			for (int j = 0; j < W; ++j) {
				if (st[j] == 'A') {
					mx = j + 1; my = i + 1;
					field[i+1][j+1] = false;
				}
				else if (st[j] == 'B') {
					gx = j + 1; gy = i + 1;
					field[i + 1][j + 1] = false;

				}
				else if (st[j] == '#') {
					field[i + 1][j + 1] =true;

				}
				else {
					field[i + 1][j + 1] = false;

				}
			}
			
		}
		string pattern; cin >> pattern;
		vector<int>moves(pattern.size());
		for (int i = 0; i < pattern.size(); ++i) {
			if (pattern[i] == '8')moves[i] = 3;
			else if (pattern[i] == '6')moves[i] = 2;
			else if (pattern[i] == '4')moves[i] = 0;
			else if (pattern[i] == '2')moves[i] = 1;
			else moves[i] = 4;
		}
		memo[mx][my][gx][gy][0] = 0;
		priority_queue<aa, vector<aa>, Compare>que;
		que.push(aa{ mx,my,gx,gy,0,0 });
		int ans = -1;
		int ansx, ansy;
		while (!que.empty()) {
			aa atop(que.top());
			que.pop();
			if (atop.gx == atop.mx&&atop.gy == atop.my) {
				ans = atop.time;
				ansx = atop.gx;
				ansy = atop.gy;
				break;
			}
			auto gp(amove(field, atop.gx, atop.gy, moves[atop.num],true));
			const int nextgx = gp.first;
			const int nextgy = gp.second;
			const int nextnum = (atop.num + 1) % moves.size();
			for (int way = 0; way < 5; ++way) {
				auto amp(amove(field, atop.mx, atop.my, way,false));

				const int nextmx = amp.first;
				const int nextmy = amp.second;
				if (memo[nextmx][nextmy][nextgx][nextgy][nextnum]>atop.time + 1) {
					memo[nextmx][nextmy][nextgx][nextgy][nextnum] = atop.time + 1;
					que.push(aa{ nextmx,nextmy,nextgx,nextgy,nextnum,atop.time + 1 });

				}
			}
		}
		if (ans == -1)cout << "impossible" << endl;
		else {
			cout << ans<<" "<<ansy-1<<" "<<ansx -1<< endl;
		}
	}
	
	return 0;
}

Measured memory_bytes: 12300