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 <stdio.h>
#include <cmath>
#include <algorithm>
#include <cfloat>
#include <stack>
#include <queue>
#include <vector>
typedef long long int ll;
#define BIG_NUM 2000000000
#define MOD 1000000007
#define EPS 0.000001
using namespace std;

int H,W;

int diff_row[5] = {-1,0,0,1,0},diff_col[5] = {0,-1,1,0,0};
char map[20][21],pattern[11];
bool***** check;

struct Info{
	int my_row,my_col,my_time,enemy_row,enemy_col;
};

bool rangeCheck(int row,int col){
	if(row >= 0 && row <= H-1 && col >= 0 && col <= W-1)return true;
	else{
		return false;
	}
}


int main(){

	bool FLG;
	int ans_row,ans_col,ans_time,next_my_row,next_my_col,next_enemy_row,next_enemy_col,pattern_length,tmp;
	check = new bool****[20];
	for(int i = 0; i < 20; i++){
		check[i] = new bool***[20];
		for(int a = 0; a < 20; a++){
			check[i][a] = new bool**[20];
			for(int b = 0; b < 20; b++){
				check[i][a][b] = new bool*[20];
				for(int c = 0; c < 20; c++)check[i][a][b][c] = new bool[10];
			}
		}
	}

	while(true){
		scanf("%d %d",&H,&W);
		if(H == 0 && W == 0)break;

		FLG = false;
		Info first;

		first.my_time = 0;

		for(int a = 0; a < H; a++){
			for(int b = 0; b < W; b++){
				for(int c = 0; c < H; c++){
					for(int d = 0; d < W; d++){
						for(int e = 0; e < 10;e++)check[a][b][c][d][e] = false;
					}
				}
			}
		}

		for(int i = 0; i < H; i++){
			scanf("%s",map[i]);
			for(int k = 0; k < W; k++){
				switch(map[i][k]){
				case 'A':
					first.my_row = i;
					first.my_col = k;
					break;
				case 'B':
					first.enemy_row = i;
					first.enemy_col = k;
					break;
				default:break;

				}
			}
		}

		scanf("%s",pattern);
		for(pattern_length = 0; pattern[pattern_length] != '\0';pattern_length++);

		queue<Info> Q;

		Q.push(first);

		int debug = 0;

		while(!Q.empty()){

			debug++;
			if(debug > 100){
				printf("Minhi!\n");
				return 0;
			}

			if(Q.front().my_row == Q.front().enemy_row && Q.front().my_col == Q.front().enemy_col){
				FLG = true;
				ans_row = Q.front().my_row;
				ans_col = Q.front().my_col;
				ans_time = Q.front().my_time;
				break;
			}

			Q.front().my_time++;

			tmp = (Q.front().my_time-1+pattern_length)%pattern_length;
			switch(pattern[tmp]){
			case '5':
				next_enemy_row = Q.front().enemy_row;
				next_enemy_col = Q.front().enemy_col;
				break;
			case '2':
				if(rangeCheck(Q.front().enemy_row+1,Q.front().enemy_col)){
					next_enemy_row = Q.front().enemy_row+1;
					next_enemy_col = Q.front().enemy_col;
				}else{
					next_enemy_row = Q.front().enemy_row;
					next_enemy_col = Q.front().enemy_col;
				}
				break;
			case '4':
				if(rangeCheck(Q.front().enemy_row,Q.front().enemy_col-1)){
					next_enemy_row = Q.front().enemy_row;
					next_enemy_col = Q.front().enemy_col-1;
				}else{
					next_enemy_row = Q.front().enemy_row;
					next_enemy_col = Q.front().enemy_col;
				}
				break;
			case '6':
				if(rangeCheck(Q.front().enemy_row,Q.front().enemy_col+1)){
					next_enemy_row = Q.front().enemy_row;
					next_enemy_col = Q.front().enemy_col+1;
				}else{
					next_enemy_row = Q.front().enemy_row;
					next_enemy_col = Q.front().enemy_col;
				}
				break;
			case '8':
				if(rangeCheck(Q.front().enemy_row-1,Q.front().enemy_col)){
					next_enemy_row = Q.front().enemy_row-1;
					next_enemy_col = Q.front().enemy_col;
				}else{
					next_enemy_row = Q.front().enemy_row;
					next_enemy_col = Q.front().enemy_col;
				}
				break;
			}

			for(int i = 0; i < 5; i++){
				next_my_row = Q.front().my_row + diff_row[i];
				next_my_col = Q.front().my_col + diff_col[i];

				if(rangeCheck(next_my_row,next_my_col) == true && map[next_my_row][next_my_col] != '#' &&
						check[next_my_row][next_my_col][next_enemy_row][next_enemy_col][tmp] == false){
					check[next_my_row][next_my_col][next_enemy_row][next_enemy_col][tmp] = true;
					Info next;
					next.enemy_row = next_enemy_row;
					next.enemy_col = next_enemy_col;
					next.my_row = next_my_row;
					next.my_col = next_my_col;
					next.my_time = Q.front().my_time;
					Q.push(next);
				}else{
					if(check[Q.front().my_row][Q.front().my_col][next_enemy_row][next_enemy_col][tmp] == false){
						check[Q.front().my_row][Q.front().my_col][next_enemy_row][next_enemy_col][tmp] = true;
						Info next;
						next.enemy_row = next_enemy_row;
						next.enemy_col = next_enemy_col;
						next.my_row = Q.front().my_row;
						next.my_col = Q.front().my_col;
						next.my_time = Q.front().my_time;
						Q.push(next);
					}
				}
			}
			Q.pop();
		}

		if(!FLG){
			printf("impossible\n");
		}else{
			printf("%d %d %d\n",ans_time,ans_row,ans_col);
		}
	}

	return 0;
}