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<iostream>
#include<map>
#include<queue>

using namespace std;

typedef pair<int,int> pi;
#define MAX 32
#define fr first
#define sc second

const int di[] = {-1,0,1,0};
const int dj[] = {0,1,0,-1};
static const int di_sz = sizeof(di)/sizeof(*di);

inline pi comp(pi p, int H, int W){
  if(p.fr>=H)p.fr=H-1;
  if(p.fr<0)p.fr=0;
  if(p.sc>=W)p.sc=W-1;
  if(p.sc<0)p.sc=0;
  return p;
}

struct ghost{
  pi p;
  ghost():p(0,0){}
  ghost(pi p):p(p){}
  void move(int ind, const string &pat, int H, int W){
    pi next=p;
    switch(pat[ind]){
    case '5':return;break;
    case '8':next.fr--;break;
    case '6':next.sc++;break;
    case '4':next.sc--;break;
    case '2':next.fr++;break;
    }
    if(next.fr>=H)next.fr=H-1;
    if(next.fr<0)next.fr=0;
    if(next.sc>=W)next.sc=W-1;
    if(next.sc<0)next.sc=0;
    p = next;
  }
};

struct state{
  int now;
  pi girl;
  vector<ghost> g;
  bool operator<(const state &t)const{
    if(now!=t.now)return now<t.now;
    if(girl.fr!=t.girl.fr)return girl.fr<t.girl.fr;
    if(girl.sc!=t.girl.sc)return girl.sc<t.girl.sc;
    for(int i=0;i<g.size();++i){
      if(g[i].p.fr!=t.g[i].p.fr)return g[i].p.fr<t.g[i].p.fr;
      if(g[i].p.sc!=t.g[i].p.sc)return g[i].p.sc<t.g[i].p.sc;
    }
    return false;
  }
};

int bfs(state init, int H, int W, char M[][MAX], const string &pat, pi &ans_pos){
  map<state,int> vis;
  queue<state> qs;
  vis[init]=0;
  qs.push(init);

  while(!qs.empty()){
    state nst = qs.front(); qs.pop();
    int ns = vis[nst];

    for(int i = 0; i < nst.g.size(); ++i){
      if( nst.girl.fr == nst.g[i].p.fr && nst.girl.sc == nst.g[i].p.sc ){
	ans_pos = nst.girl;
	return ns;
      }
    }

    for(int k = 0; k < di_sz; ++k){
      state Next=nst;
      pi next(nst.girl.fr+di[k], nst.girl.sc+dj[k]);
      next =comp(next,H,W);
      if(M[next.fr][next.sc]=='#')next=nst.girl;
      Next.girl = next;
    
      // move ghosts;
      for(int i = 0; i < nst.g.size(); ++i){
	Next.g[i].move( nst.now, pat, H, W );
      }
      Next.now++;
      if(Next.now>=pat.length()){
	Next.now=0;
      }
      
      if( vis.find(Next) == vis.end() ){
	vis[Next]=ns+1;
	qs.push(Next);
      }else if( vis[Next] > ns+1 ){
	vis[Next]=ns+1;
	qs.push(Next);
      }
    }

  }
  return -1;
}


int main()
{
  while(true){
    int H,W;
    string pat;
    state init;
    char M[MAX][MAX] = {{0,},};
    cin >> H >> W;
    if( H == 0 && W == 0 )break;
    
    for(int i = 0; i < H; ++i){
      for(int j = 0; j < W; ++j){
	char c; cin >> c;
	if( c == 'A'){
	  init.girl = make_pair(i,j);
	  M[i][j]='.';
	}else if( c == 'B'){
	  init.g.push_back( ghost(make_pair(i,j) ) );
	  M[i][j]='.';
	}else{
	  M[i][j]=c;
	}
      }
    }
    init.now=0;
    cin >> pat;
    pi ans_pos;
    int ans_step = bfs(init,H,W,M,pat,ans_pos);
    if( ans_step >= 0 ){
      cout << ans_step << ' ' << ans_pos.fr << ' ' << ans_pos.sc << endl;
    }else{
      cout << "impossible" << endl;
    }
  }
  return 0;
}

C++: #include<bits/stdc++.h>
#define rep(i,n)for(int i=0;i<(n);i++)
using namespace std;
typedef pair<int, int>P;

char s[20][21];
int d[20][20];
int dx[]{ 0,-1,0,0,1 }, dy[]{ 0,0,1,-1,0 };

int main() {
	int h, w;
	while (scanf("%d%d", &h, &w), h) {
		int ax, ay, bx, by;
		rep(i, h) {
			scanf("%s", s[i]);
			rep(j, w) {
				if (s[i][j] == 'A')ax = i, ay = j;
				if (s[i][j] == 'B')bx = i, by = j;
			}
		}
		string p; cin >> p;
		for (char&c : p) {
			if (c == '5')c = 0;
			if (c == '8')c = 1;
			if (c == '6')c = 2;
			if (c == '4')c = 3;
			if (c == '2')c = 4;
		}
		queue<P>que;
		memset(d, -1, sizeof(d));
		d[ax][ay] = 0; que.push(P(ax, ay));
		while (!que.empty()) {
			P p = que.front(); que.pop();
			for (int i = 1; i <= 4; i++) {
				int nx = p.first + dx[i], ny = p.second + dy[i];
				if (0 <= nx&&nx < h && 0 <= ny&&ny < w&&s[nx][ny] != '#'&&d[nx][ny] == -1) {
					d[nx][ny] = d[p.first][p.second] + 1;
					que.push(P(nx, ny));
				}
			}
		}
		int x = bx, y = by;
		int t = 0;
		rep(i, 100) {
			for (char c : p) {
				if (d[x][y] != -1 && d[x][y] <= t) {
					printf("%d %d %d\n", t, x, y); goto g;
				}
				int nx = x + dx[c], ny = y + dy[c]; t++;
				if (0 <= nx&&nx < h && 0 <= ny&&ny < w)x = nx, y = ny;
			}
		}
		puts("impossible");
	g:;
	}
}

C++: #import<stdio.h>
#import<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)++t,q.push(0);else for(i=4;i--;)if(f[x=a+" 57L"[i]-54]==-1)f[x]=t,q.push(x);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-54+"L65676 "[p[i]-50]]>-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);}}