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 <queue>
#include <string>
#include <vector>
#include <iostream>
using namespace std;
int dir[] = { 0, 1, 0, -1 };
int H, W, dist[25][25]; string s[25], t;
int main() {
	while (cin >> H >> W, H) {
		int ax = -1, ay = -1, bx = -1, by = -1;
		for (int i = 0; i < H; i++) {
			cin >> s[i];
			for (int j = 0; j < W; j++) {
				if (s[i][j] == 'A') ax = i, ay = j;
				if (s[i][j] == 'B') bx = i, by = j;
			}
		}
		cin >> t;
		for (int i = 0; i < H; i++) {
			for (int j = 0; j < W; j++) {
				dist[i][j] = 999999999;
			}
		}
		queue<pair<int, int> > que; que.push(make_pair(ax, ay)); dist[ax][ay] = 0;
		while (!que.empty()) {
			pair<int, int> u = que.front(); que.pop();
			for (int i = 0; i < 4; i++) {
				int tx = u.first + dir[i], ty = u.second + dir[i ^ 1];
				if (0 <= tx && tx < H && 0 <= ty && ty < W && s[tx][ty] != '#' && dist[tx][ty] == 999999999) {
					dist[tx][ty] = dist[u.first][u.second] + 1;
					que.push(make_pair(tx, ty));
				}
			}
		}
		if (dist[bx][by] == -1) cout << "Impossible" << endl;
		else {
			for (int i = 0; ; i++) {
				if (dist[bx][by] <= i) {
					cout << i << ' ' << bx << ' ' << by << endl;
					break;
				}
				int tx = bx, ty = by;
				if (t[i % t.size()] == '2') tx++;
				if (t[i % t.size()] == '4') ty--;
				if (t[i % t.size()] == '6') ty++;
				if (t[i % t.size()] == '8') tx--;
				if (0 <= tx && tx < H && 0 <= ty && ty < W) bx = tx, by = ty;
			}
		}
	}
	return 0;
}

C++: #include<iostream>
#include<cstring>
#include<map>
#include<string>
#include<vector>
#include<algorithm>
#define all(c) c.begin(),c.end()
#define pb push_back
#define INF 10000000
using namespace std;
typedef pair<int,int> P;
int w,h;
vector<string> s;
P d[10];
int antime;
P q;
map<int,int> mp;
string op;
int dp[20][20][20][20][100];
bool in(P n){
	if(n.second>=0&&n.second<w&&n.first>=0&&n.first<h)
		return true;
	return false;
}
void f(int cnt){
	cout<<cnt<<endl;
	f(cnt+1);
}
int ans;
int ret(P a,P b,int time){
	//cout<<time<<endl;
	
	if(a==b){
		if(antime>time){
			antime=time;
			q.first=a.first;
			q.second=a.second;
		}
		//cout<<a.first<<" "<<a.second<<endl;
		//cout<<time<<endl;
		return time;
	}
	if(100<time)
	return INF;
	
	if(dp[a.first][a.second][b.first][b.second][time]!=-1)
		return dp[a.first][a.second][b.first][b.second][time];
	
	int ans=INF;
	P na,nb;
	
	nb.first=b.first+d[op[time%op.size()]-'0'].first;
	nb.second=b.second+d[op[time%op.size()]-'0'].second;
	
	if(!in(nb))
		nb=b;
	for(int i=0;i<5;i++){
		na.first=a.first+d[mp[i]].first;
		na.second=a.second+d[mp[i]].second;
		
		if(in(na)&&s[na.first][na.second]!='#'){
			//<<"-------"<<endl;
			ans=min(ans,ret(na,nb,time+1));
		}/*(time%op.size()))*/
	}
	return dp[a.first][a.second][b.first][b.second][time]=ans;
}
int main(){
	d[5]=P(0,0);d[8]=P(-1,0);d[6]=P(0,1);d[4]=P(0,-1);d[2]=P(1,0);
	mp[0]=5;mp[1]=8;mp[2]=6;mp[3]=4;mp[4]=2;
	while(cin>>h>>w,h||w){
		s.clear();
		P a,b;
		antime=INF;
		memset(dp,-1,sizeof(dp));
		for(int i=0;i<h;i++){
			string t;
			cin>>t;
			s.pb(t);
			for(int j=0;j<t.size();j++){
				if(t[j]=='A'){
					a.first=i;a.second=j;
				}else if(t[j]=='B'){
					b.first=i;b.second=j;
				}
			}
		}cin>>op;
		ret(a,b,0);
		if(antime!=INF)
			cout<<antime<<  " "<<q.first<<" "<<q.second<<endl;
		else
		cout<<"impossible"<<endl;
		//f(0);
		
		//cout<<<<endl;
	}
	return 0;
}

C++: #import<stdio.h>
#import<queue>
int main(){
	std::queue<int>q;
	int w,h,f[484],i,j,d[]={22,0,-1,0,1,0,-22},a,b,t,x,z;
	char p[15];
	for(;scanf("%d%d ",&h,&w),h;){
		for(j=0;j<w+2;j++)f[j]=f[j-~h*22]=-9;
		for(i=1;i<=h;i++){
			for(j=1;j<=w;j++){
				f[x=i*22+j]=-1;
				switch(getchar()){
					case'#':--f[x];break;
					case'A':a=x;break;
					case'B':b=x;break;
				}
			}
			f[i*22]=f[i*22-~w]=-9;
			getchar();
		}
		
		f[a]=t=0;
		q.push(0);
		for(q.push(a);q.size()>1;){
			a=q.front();
			q.pop();
			if(a)
				for(i=0;i<7;i+=2)
					if(f[x=a+d[i]]==-1)
						f[x]=t,q.push(x);
			else
				++t,q.push(0);
		}
		q.pop();
		scanf("%s",p);
		for(a=t=0;!a;){
			x=b;
			z=0;
			for(i=0;!a&&p[i];i++){
				t++;
				f[j=b+d[p[i]-'2']]>-3?b=j:0;
				f[b]>=0&&t>=f[b]?a=b:0;
				f[b]>=0&&++z;
			}
			!z&!a&!p[i]&b==x&f[b]<0&&--a;
		}
		printf(a<0?"impossible\n":"%d %d %d\n",t,a/22-1,a%22-1);
	}
}