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>

using namespace std;

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

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

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

int h, w, ax, ay, bx, by, ans;
char field[20][20];
char pattern[10];

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);

		ans = -1;

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

		REP(i,h*w) {

			// 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--;
					break;
				case '6':
					bx++;
					break;
				case '4':
					bx--;
					break;
				case '2':
					by++;
					break;	
			}

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

		if (ans < 0) {
			printf("impossible\n");
		} else {
			printf("%d\n", ans);
		}

	}

	return 0;

}

C++: #include <iostream>
#include <algorithm>
#include <string>
#include <cstdio>
#include <queue>

using namespace std;

class State{
public:
  int ay, ax, by, bx, t;
  State(int ay = 0, int ax = 0, int by = 0, int bx = 0, int t = 0)
    : ay(ay), ax(ax), by(by), bx(bx), t(t) {}
};

int h, w;
char data[20][20];
int pat[10];
int pat_size;
int say, sax, sby, sbx;
int dy[] = {-1, 0, 1, 0, 0};
int dx[] = {0, 1, 0, -1, 0};

bool check(int y, int x){
  if(y<0 || y>=h) return false;
  if(x<0 || x>=w) return false;
  return true;
}

void solve(){
  int ans = -1, ansy, ansx;
  bool vis[20][20][20][20][10];
  State u = State(say, sax, sby, sbx, 0), v;
  fill(vis[0][0][0][0], vis[20][0][0][0], false);
  queue<State> q;
  q.push(u);
  while(!q.empty()){
    u = q.front(); q.pop();
    if(u.ay == u.by && u.ax == u.bx){
      ans = u.t;
      ansy = u.ay;
      ansx = u.ax;
      break;
    }
    int nby = u.by + dy[pat[u.t%pat_size]];
    int nbx = u.bx + dx [pat[u.t%pat_size]];
    if(!check(nby, nbx)){
      nby = u.by;
      nbx = u.bx;
    }
    for(int i=0;i<4;i++){
      int nay = u.ay + dy[i];
      int nax = u.ax + dx[i];
      if(!check(nay, nax)){
        nay = u.ay;
        nax = u.ax;
      }
      if(data[nay][nax] == '#'){
        nay = u.ay;
        nax = u.ax;
      }
      if(!vis[nay][nax][nby][nbx][u.t%pat_size]){
        vis[nay][nax][nby][nbx][u.t%pat_size] = true;
        q.push(State(nay, nax, nby, nbx, u.t+1));
      }
    }
  }
  if(ans == -1){
    cout << "impossible" << endl;
  }else{
    cout << ans << ' ' << ansy << ' ' << ansx << endl;
  }
}

main(){
  while(cin >> h >> w && (h|w)){
    for(int i=0;i<h;i++){
      for(int j=0;j<w;j++){
        cin >> data[i][j];
        if(data[i][j] == 'A'){
          say = i;
          sax =j;
          data[i][j] = '.';
        }
        if(data[i][j] == 'B'){
          sby = i;
          sbx = j;
          data[i][j] = '.';
        }
      }
    }
    getchar();
    string in;
    getline(cin, in);
    pat_size = in.size();
    for(int i=0;i<pat_size;i++){
      if(in[i] == '8') pat[i] = 0;
      if(in[i] == '6') pat[i] = 1;
      if(in[i] == '2') pat[i] = 2;
      if(in[i] == '4') pat[i] = 3;
      if(in[i] == '5') pat[i] = 4;
    }
    solve();
  }
}

C++: #include<stdio.h>
#include<queue>
int main(){
std::queue<int>q;
int w,h,f[484],i,j,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,
z=getchar(),
z-35?z>65?b=x:z>64?a=x:1:--f[x];
f[i*22]=f[i*22-~w]=-9;
getchar();
}

f[a]=t=0;
q.push(0);
for(q.push(a);a=q.front(),q.size()>1;q.pop())
if(a){
for(i=4;i--;)
if(f[x=a+" 57L"[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+"L65676 "[p[i]-50]-54]>-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);
}
}