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 <string.h>
#include <list>
#include <algorithm>

using namespace std;

typedef struct {
	int x, y;
} Vector;

typedef struct {
	int x, y;
	int step;
} DATA;

unsigned int data[16 + 2][16 + 2];
char map[16 + 2][16 + 2];

int change(char move[], Vector mv[])
{
	int i = 0;
	while (move[i] != '\0'){
		mv[i].x = mv[i].y = 0;
		switch (move[i]){
		  case '5':
		  	break;
		  case '8':
		  	mv[i].y = -1;
			break;
		  case '6':
		  	mv[i].x = 1;
			break;
		  case '4':
		  	mv[i].x = -1;
			break;
		  case '2':
		  	mv[i].y = 1;
			break;
		}
		i++;
	}
	return (i);
}

unsigned int move_sml(int gx, int gy, Vector mv[], int move_count, int* ans_x, int* ans_y)
{
	unsigned int ret = 0xffffffff;
	for (unsigned int i = 0; i < 1000000; i++){
		int mx = mv[i % move_count].x;
		int my = mv[i % move_count].y;
		
		if (data[gx][gy] <= i && ret > i){
			ret = max(data[gx][gy], i);
			*ans_x = gx;
			*ans_y = gy;
		}
		
		if (map[gx + mx][gy + my] != -1){
			gx += mx;
			gy += my;
		}
	}
	
	return (ret);
}

int move_short_root(int sx, int sy)
{
	list<DATA> lst;
	DATA add;
	
	data[sx][sy] = 0;
	
	add.x = sx + 1;
	add.y = sy;
	add.step = 1;
	lst.push_back(add);
	add.x = sx - 1;
	add.y = sy;
	add.step = 1;
	lst.push_back(add);
	add.x = sx;
	add.y = sy + 1;
	add.step = 1;
	lst.push_back(add);
	add.x = sx;
	add.y = sy - 1;
	add.step = 1;
	lst.push_back(add);
	
	while (!lst.empty()){
		if (map[lst.front().x][lst.front().y] != -1 && map[lst.front().x][lst.front().y] != '#' && data[lst.front().x][lst.front().y] > lst.front().step){
			data[lst.front().x][lst.front().y] = lst.front().step;
			add.x = lst.front().x + 1;
			add.y = lst.front().y;
			add.step = lst.front().step + 1;
			lst.push_back(add);
			add.x = lst.front().x - 1;
			add.y = lst.front().y;
			lst.push_back(add);
			add.x = lst.front().x;
			add.y = lst.front().y + 1;
			lst.push_back(add);
			add.x = lst.front().x;
			add.y = lst.front().y - 1;
			lst.push_back(add);
		}
		lst.pop_front();
	}
	
	return (0);
}

int main(void)
{
	int hight, width;
	int ans_x, ans_y;
	int sx, sy, gx, gy;
	char move[11];
	Vector mv[10];
	int move_count;
	unsigned int ans;
	
	while (1){
		memset(data, 0xff, (18 * 18) * 4);
		memset(map, -1, (18 * 18));
		cin >> hight >> width;
		if (hight == 0 && width == 0)break;
		for (int y = 0; y < hight + 2; y++){
			char str[16 + 1];
			if (y == 0 || y == hight + 1){
				for (int x = 0; x < width + 2; x++){
					map[x][y] = -1;
				}
			}
			else {
				cin >> str;
				map[0][y] = map[width + 1][y] = -1;
				for (int x = 0; x < width; x++){
					if (str[x] == 'A'){
						sx = x + 1;
						sy = y;
					}
					if (str[x] == 'B'){
						gx = x + 1;
						gy = y;
					}
					map[x + 1][y] = str[x];
				}
			}
		}
		cin >> move;
		
		move_count = change(move, mv);
		
		move_short_root(sx, sy);
		
		ans = move_sml(gx, gy, mv, move_count, &ans_x, &ans_y);
		
		if (ans == 0xffffffff){
			cout << "impossible" << endl;
		}
		else {
			cout << ans << ' ' << ans_y - 1 << ' ' << ans_x - 1 << endl;
		}
		
	}
	
	return (0);
}

C++: #include <bits/stdc++.h>
using namespace std;
#define F first
#define S second
#define INF 1<<29
typedef pair<int,int> P;
struct PP {
  P a,b;
  int kk;
};

int dx[5]={-1,0,1,0,0},dy[5]={0,1,0,-1,0};
bool check(int n,int m,int x,int y){return x>=0&&x<n&&y>=0&&y<m;}

int main() {
  int n,m;
  while(cin >> n >> m && n) {
    string s[n],t;
    for(int i=0; i<n; i++) cin >> s[i];
    cin >> t;
    for(int i=0; i<t.size(); i++) {
      if(t[i]=='5') t[i]='4';
      else if(t[i]=='8') t[i]='0';
      else if(t[i]=='6') t[i]='1';
      else if(t[i]=='2') t[i]='2';
      else t[i]='3';
    }
    P p1,p2;
    for(int i=0; i<n; i++) {
      for(int j=0; j<m; j++) {
        if(s[i][j]=='A') p1=P(i,j);
        if(s[i][j]=='B') p2=P(i,j);
      }
    }
    int d[n][m][n][m][t.size()];
    for(int i=0;i<n;i++)for(int i2=0;i2<m;i2++)for(int i3=0;i3<n;i3++)for(int i4=0;i4<m;i4++)for(int i5=0;i5<t.size();i5++)d[i][i2][i3][i4][i5]=INF;
    d[p1.F][p1.S][p2.F][p2.S][t.size()-1]=0;
    queue<PP> que;
    que.push((PP){p1,p2,t.size()-1});
    while(!que.empty()) {
      PP p=que.front();que.pop();
      int nx=p.a.F,ny=p.a.S,k=p.kk;
      P q=p.b;
      int cost=d[nx][ny][p.b.F][p.b.S][p.kk];
      if(p.a==p.b) {
        cout << cost << " " << nx << " " << ny << endl;
        goto end;
      }
      k=(k+1)%t.size();
      int r=t[k]-'0';
      q.F+=dx[r],q.S+=dy[r];
      if(!check(n,m,q.F,q.S)) q=p.b;
      for(int i=0; i<5; i++) {
        int x=nx+dx[i],y=ny+dy[i];
        if(!check(n,m,x,y)||s[x][y]=='#') continue;
        if(d[x][y][q.F][q.S][k]>cost+1) {
          d[x][y][q.F][q.S][k]=cost+1;
          que.push((PP){P(x,y),q,k});
        }
      }
    }
    cout << "impossible" << endl;
  end:;
  }
  return 0;
}