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<string.h>
#include<queue>
#include<map>
#include<limits.h>
int main()
{
	int h,w,i,j,x,y,ax,ay,gx,gy,d[22][22],r,f,dx[]={1,0,-1,0,0},dy[]={0,1,0,-1,0};
	char m[22][22],g[15],*p;
	while(scanf("%d%d",&h,&w),h)
	{
		for(i=1;i<=h;++i)
		{
			scanf("%s",m[i]+1);
			if(p=strchr(m[i]+1,'A'))ax=p-m[i],ay=i;
			if(p=strchr(m[i]+1,'B'))gx=p-m[i],gy=i;
		}
		scanf("%s",g);

		for(i=0;i<h+1;++i)m[i][0]=m[i][w+1]='#';
		for(j=0;j<w+1;++j)m[0][j]=m[h+1][j]='#';
		//Aツつゥツづァツづ個催短ツ仰猟猟」ツづーツ出ツつキ
		for(i=0;i<22;++i)for(j=0;j<22;++j)d[j][i]=INT_MAX;
		typedef std::pair<int,int>P;
		std::queue<P>q;
		P _;
		q.push(P(ax,ay));
		q.push(P(-1,-1));
		r=0;
		while(q.size()>1)
		{
			_=q.front();q.pop();
			if(_.first<0){++r;q.push(_);continue;}
			if(m[_.second][_.first]=='#')continue;
			if(d[_.second][_.first]<=r)continue;
			d[_.second][_.first] = r;
			for(i=0;i<4;++i)q.push(P(_.first+dy[i],_.second+dx[i]));
		}int lx=-1,ly=-1;r=1;
		f=0;
		for(;;)
		{
			if(lx==gx && ly==gy && !f)
			{
				puts("impossible");
				goto E;
			}
			lx=gx;ly=gy;
			for(f=i=0;i<strlen(g);++i,++r)
			{
				int t[]={4,4,1,4,2,4,0,4,3};
				x=gx+dx[t[g[i]-'0']];
				y=gy+dy[t[g[i]-'0']];
				if(x>0&&x<=w&&y>0&&y<=h)gx=x,gy=y;
				if(d[gy][gx]!=INT_MAX)f=1;if(d[gy][gx]<=r)
				{
					printf("%d %d %d\n",r,gy-1,gx-1);
					goto E;
				}
			}
		}
E:;
	}
	return 0;
}

C++: #include <iostream>
#include <string>
#include <queue>
#include <tuple>
#include <cstdio>
using namespace std;
typedef tuple<int, int, int> T;

int h, w;
string s[20];
int meY, meX;
int gostY, gostX;
string moves;

int minCost[20][20];
int INF = 1000;

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

void outAns() {
	int y = gostY;
	int x = gostX;
	
	for (int i = 0; i < INF; i++) {
		if (minCost[y][x] <= i) {
			cout << i << " " << y << " " << x << endl;
			return;
		}
		
		char type = moves[i % moves.length()];
		char *dir = "8624";
		int j;
		for (j = 0; j < 4; j++) {
			if (dir[j] == type) {
				break;
			}
		}
		if (j == 4) continue;
		
		//?????? == j??§?§????
		int ny = y + dy[j];
		int nx = x + dx[j];
		if (0 <= ny && ny < h && 0 <= nx && nx < w) {
			y = ny;
			x = nx;
		}
	}
	cout << "impossible" << endl;
}

int main() {
	while (cin >> h >> w, h) {
		int i, j;
		for (i = 0; i < h; i++) cin >> s[i];
		for (i = 0; i < h; i++) {
			for (j = 0; j < w; j++) {
				if (s[i][j] == 'A') {
					meY = i;
					meX = j;
				}
				if (s[i][j] == 'B') {
					gostY = i;
					gostX = j;
				}
			}
		}
		cin >> moves;
		
		for (i = 0; i < h; i++) for (j = 0; j < w; j++) minCost[i][j] = INF;
		
		queue<T> que;	//cst, y, x
		que.push(T(0, meY, meX));
		while (!que.empty()) {
			T now = que.front(); que.pop();
			int cst = get<0>(now);
			int y = get<1>(now);
			int x = get<2>(now);
			if (minCost[y][x] <= cst) continue;
			minCost[y][x] = cst;
			
			for (int i = 0; i < 4; i++) {
				int ny = y + dy[i];
				int nx = x + dx[i];
				if (!(0 <= ny && ny < h && 0 <= nx && nx < w)) continue;
				if (s[ny][nx] == '#') continue;
				que.push(T(cst + 1, ny, nx));
			}
		}
		
		outAns();
	}
	return 0;
}