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 <cstdlib>
#include <cstring>
#include <limits>
#include <iostream>
#include <queue>
#include <unordered_map>
#include <vector>
using namespace std;

constexpr int MAX_SIZE = 20;
constexpr int MAX_LENGTH = 10;

constexpr int dx[5] = {1, -1, 0, 0, 0};
constexpr int dy[5] = {0, 0, 1, -1, 0};
const unordered_map<char, int> conv{{'6', 0}, {'4', 1}, {'2', 2}, {'8', 3}, {'5', 4}};

int h, w;
string field[MAX_SIZE];
string pattern;

int t, ax, ay;
int label[MAX_SIZE][MAX_SIZE];
bool visited[MAX_SIZE][MAX_SIZE][MAX_LENGTH];

inline bool out(int x, int y) {
	return x < 0 || y < 0 || x >= w || y >= h;
}

void bfs(int sx, int sy) {
	memset(label, -1, sizeof(label));
	label[sy][sx] = 0;
	queue<pair<int, int>> que;
	que.push({sx, sy});

	while(!que.empty()) {
		const int x = que.front().first;
		const int y = que.front().second;
		que.pop();

		for(int d = 0; d < 4; ++d) {
			const int nx = x + dx[d];
			const int ny = y + dy[d];

			if(out(nx, ny) || field[ny][nx] == '#') continue;
			if(label[ny][nx] == -1) {
				label[ny][nx] = label[y][x] + 1;
				que.push({nx, ny});
			}
		}
	}
}

void search(int x, int y, int tc) {
	if(label[y][x] != -1) {
		const int tt = max(tc, label[y][x]);
		if(tt < t) {
			t = tt;
			ax = x;
			ay = y;
		}
	}

	const int idx = tc % pattern.size();
	if(visited[x][y][idx]) return;
	visited[x][y][idx] = true;

	int nx = x + dx[conv.at(pattern[idx])];
	int ny = y + dy[conv.at(pattern[idx])];
	if(out(nx, ny)) {
		nx = x;
		ny = y;
	}
	search(nx, ny, tc + 1);
}

int main() {
	cin.tie(nullptr);
	ios::sync_with_stdio(false);

	while(cin >> h >> w && h) {
		for(int i = 0; i < h; ++i) {
			cin >> field[i];
		}
		cin >> pattern;

		int sx, sy, gx, gy;
		for(int i = 0; i < h; ++i) {
			for(int j = 0; j < w; ++j) {
				if(field[i][j] == 'A') {
					sx = j;
					sy = i;
					field[i][j] = '.';
				}
				else if(field[i][j] == 'B') {
					gx = j;
					gy = i;
					field[i][j] = '.';
				}
			}
		}

		bfs(sx, sy);
		memset(visited, false, sizeof(visited));
		t = numeric_limits<int>::max();
		search(gx, gy, 0);
		if(t == numeric_limits<int>::max()) {
			cout << "impossible" << endl;
		}
		else {
			cout << t << " " << ay << " "<< ax << endl;
		}
	}

	return EXIT_SUCCESS;
}

C++: #include <bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef pair<int,int> pii;

#define REP(i,n) for(ll i=0;i<n;i++)

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

int h, w, ax, ay, bx, by, t, flag;
char field[30][30];
char pattern[20];

int main() {

	while(true) {

		scanf("%d%d", &h, &w);

		if (h == 0 && w == 0) break;

		REP(y,h) {
			scanf("%s", field[y]);
			REP(x,w) {
				if (field[y][x] == 'A') {
					ax = x;
					ay = y;
				} else if (field[y][x] == 'B') {
					bx = x;
					by = y;
				}
			}
		}

		scanf("%s", pattern);

		int leng = strlen(pattern);

		t = 0, flag = 0;

		queue<pii> q, nq;
		q.push(pii(ax,ay));

		REP(i,200) {
			t++;

			// girl
			while(!q.empty()) {
				pii p = q.front();
				q.pop();
				REP(j,4) {
					int nx = p.first + dx[j];
					int ny = p.second + dy[j];
					if (0<=nx&&nx<w && 0<=ny&&ny<h && field[ny][nx]!='#') {
						field[ny][nx] = 'A';
						nq.push(pii(nx,ny));
					}
				}
			}
			while(!nq.empty()) {
				q.push(nq.front());
				nq.pop();
			}

			// ghost
			switch(pattern[i%leng]) {
				case '5':
				break;
				case '8':
				by--;
				if(by<0)by=0;
				break;
				case '6':
				bx++;
				if(bx>=w)bx=w-1;
				break;
				case '4':
				bx--;
				if(bx<0)bx=0;
				break;
				case '2':
				by++;
				if(by>=h)by=h-1;
				break;	
			}

			if (field[by][bx] == 'A') {
				flag = 1;
				break;
			}
		}

		if (flag == 0) {
			printf("impossible\n");
		} else {
			printf("%d %d %d\n", t, by, bx);
		}

	}

	return 0;

}