Go: package main

import (
	"bufio"
	"fmt"
	"math"
	"os"
	"strconv"
)

func configure(scanner *bufio.Scanner) {
	scanner.Split(bufio.ScanWords)
	scanner.Buffer(make([]byte, 1000005), 1000005)
}
func getNextString(scanner *bufio.Scanner) string {
	scanned := scanner.Scan()
	if !scanned {
		panic("scan failed")
	}
	return scanner.Text()
}
func getNextInt(scanner *bufio.Scanner) int {
	i, _ := strconv.Atoi(getNextString(scanner))
	return i
}
func getNextInt64(scanner *bufio.Scanner) int64 {
	i, _ := strconv.ParseInt(getNextString(scanner), 10, 64)
	return i
}
func getNextFloat64(scanner *bufio.Scanner) float64 {
	i, _ := strconv.ParseFloat(getNextString(scanner), 64)
	return i
}
func main() {
	fp := os.Stdin
	wfp := os.Stdout
	extra := 0
	if os.Getenv("I") == "IronMan" {
		fp, _ = os.Open(os.Getenv("END_GAME"))
		extra = 100
	}
	scanner := bufio.NewScanner(fp)
	configure(scanner)
	writer := bufio.NewWriter(wfp)
	defer func() {
		r := recover()
		if r != nil {
			fmt.Fprintln(writer, r)
		}
		writer.Flush()
	}()
	solve(scanner, writer)
	for i := 0; i < extra; i++ {
		fmt.Fprintln(writer, "-----------------------------------")
		solve(scanner, writer)
	}
}
func solve(scanner *bufio.Scanner, writer *bufio.Writer) {
	dy := [4]int{-1, 0, 0, 1}
	dx := [4]int{0, -1, 1, 0}
	for {
		h := getNextInt(scanner)
		w := getNextInt(scanner)
		if h == 0 {
			break
		}
		grid := makeGrid(h, w)
		a := [2]int{}
		b := [2]int{}
		for i := 0; i < h; i++ {
			s := getNextString(scanner)
			for j := 0; j < w; j++ {
				if s[j] == '#' {
					grid[i][j] = math.MaxInt32
					continue
				}
				if s[j] == 'A' {
					a[0] = i
					a[1] = j
					continue
				}
				if s[j] == 'B' {
					b[0] = i
					b[1] = j
				}
				grid[i][j] = math.MaxInt32 - 1
			}
		}
		q := make([][2]int, 0)
		q = append(q, a)
		for len(q) > 0 {
			p := q[0]
			q = q[1:]
			for i := 0; i < 4; i++ {
				yy := p[0] + dy[i]
				xx := p[1] + dx[i]
				if yy == a[0] && xx == a[1] {
					continue
				}
				if yy < 0 || yy >= h {
					continue
				}
				if xx < 0 || xx >= w {
					continue
				}
				if grid[yy][xx] == math.MaxInt32 {
					continue
				}
				if grid[yy][xx] <= grid[p[0]][p[1]]+1 {
					continue
				}
				grid[yy][xx] = grid[p[0]][p[1]] + 1
				q = append(q, [2]int{yy, xx})
			}
		}
		move := getNextString(scanner)
		i := 0
		m := len(move)
		for {
			if i > 400 {
				fmt.Fprintln(writer, "impossible")
				break
			}
			if grid[b[0]][b[1]] <= i {
				fmt.Fprintln(writer, fmt.Sprintf("%d %d %d", i, b[0], b[1]))
				break
			}
			switch move[i%m] {
			case '8':
				if b[0] > 0 {
					b[0]--
				}
			case '6':
				if b[1]+1 < w {
					b[1]++
				}
			case '4':
				if b[1] > 0 {
					b[1]--
				}
			case '2':
				if b[0]+1 < h {
					b[0]++
				}
			}
			i++
		}
	}
}
func makeGrid(h, w int) [][]int {
	index := make([][]int, h, h)
	data := make([]int, h*w, h*w)
	for i := 0; i < h; i++ {
		index[i] = data[i*w : (i+1)*w]
	}
	return index
}

C++: #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;
}