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 <algorithm>
#include <string>
#include <queue>
using namespace std;
struct po{int x,y,dis;};
int h,w;
string mp[20],str;
int D[21][21];

void bfs(po s){
  for(int i=0;i<h;i++)
    for(int j=0;j<w;j++) D[i][j] = 10000000;
  D[s.y][s.x] = 0;
  queue<po> Q;
  Q.push((po){s.x,s.y,0});
  while(!Q.empty()){
    po t=Q.front();Q.pop();
    int dx[]={0,0,-1,1};
    int dy[]={1,-1,0,0};
    for(int i=0;i<4;i++){
      int nx = t.x+dx[i];
      int ny = t.y+dy[i];
      if(nx<0||ny<0||nx>=w||ny>=h||mp[ny][nx]!='.'||D[ny][nx]<=t.dis+1)continue;
      Q.push((po){nx,ny,t.dis+1});
      D[ny][nx]=t.dis+1;
    }
  }
}

void move(po s){
  po ima,ans;
  ima.x=s.x,ima.y=s.y;
  if(D[ima.y][ima.x]==0)ans.x=ima.x,ans.y=ima.y,ans.dis=0;
  else ans.dis = 10000000;
  int visited[21][21]={};
  int dx[]={0,-1,1,0};
  int dy[]={1,0,0,-1};
  int cnt=0;
  while(1){
    visited[ima.y][ima.x]=1;
    for(int i=0;i<str.size();i++){
      cnt++;
      int j = (str[i]-'0')/2-1;
      int nx=ima.x+dx[j];
      int ny=ima.y+dy[j];
      if(nx<0||ny<0||nx>=w||ny>=h||str[i]=='5')nx=ima.x,ny=ima.y;
      ima.x=nx,ima.y=ny;
      if(ans.dis>cnt&&cnt>D[ny][nx]) ans.x=ima.x,ans.y=ima.y,ans.dis=cnt;
    }
    if(cnt>5000)break;
  }
  if(ans.dis==10000000) cout <<"impossible"<<endl;
  else cout<< ans.dis<<" " << ans.y <<" "<< ans.x<<endl;
}
 

int main() {

  while(1){
    cin >> h >> w;
    if(h==0 && w==0)break;
    for(int i=0;i<h;i++) cin >> mp[i];
    cin>> str;
    
    po A,B;
    for(int i=0;i<h;i++)
      for(int j=0;j<w;j++){
	if(mp[i][j] == 'A') A.y=i ,A.x=j;
	if(mp[i][j]=='B') B.y=i,B.x=j;
      }

    for(int i=0;i<h;i++)
      for(int j=0;j<w;j++)
	if(mp[i][j] == 'A'||mp[i][j]=='B') mp[i][j] = '.';
  
    bfs(A);
    move(B);
  }
  return 0;
}

C++: #include<iostream>
#include<queue>
using namespace std;

typedef pair<int ,int > P;
typedef pair<int, P> P2;

bool v[30][30],vb[30][30][20];
string g[30],L;
int h,w,s;
int ay,ax,by,bx;
int dy[] = {-1,0,1,0}, dx[] = {0,1,0,-1};

int main(){
  while(cin >> h >> w , h||w){
    for(int i=0;i<h;i++)cin >> g[i];
    cin >> L;
    s = L.size();
    for(int i=0;i<h;i++)
      for(int j=0;j<w;j++){
	if(g[i][j] == 'A'){
	  ay = i; ax = j;
	}
	if(g[i][j] == 'B'){
	  by = i; bx = j;
	}
	v[i][j] = false;
	for(int k=0;k<s;k++)vb[i][j][k] = false;
      }

    int t = 0;
    queue<P2> q;
    v[ay][ax] = true;
    q.push(P2(0,P(ay,ax)));

    while(!q.empty()){
      P2 p = q.front();q.pop();
 
      if(p.first==t+1){
	vb[by][bx][t%s] = true;
	if(v[by][bx])break;
	if(L[t%s] == '8' && 0<by)by--;
	if(L[t%s] == '6' && bx<w-1)bx++;
	if(L[t%s] == '2' && by<h-1)by++;
	if(L[t%s] == '4' && 0<bx)bx--;
	t++;
      }

      for(int i=0;i<4;i++){
	int sy = p.second.first + dy[i] , sx = p.second.second + dx[i];
	if(sy<0 || sx<0 || h<=sy || w<=sx)continue;
	if(v[sy][sx] || g[sy][sx]=='#')continue;
	v[sy][sx] = true;
	q.push(P2(p.first+1,P(sy,sx)));
      }
    }

    if(v[by][bx])cout << t << " " << by << " " << bx << endl;
    else {
      for(int i=0;;i++){
	if(vb[by][bx][(t+i)%s]){
	  cout << "impossible\n";
	  break;
	}
	vb[by][bx][(t+i)%s] = true;
	if(L[(t+i)%s] == '2' && 0<by)by--;
	if(L[(t+i)%s] == '6' && bx<w-1)bx++;
	if(L[(t+i)%s] == '8' && by<h-1)by++;
	if(L[(t+i)%s] == '4' && 0<bx)bx--;
	if(v[by][bx]){
	  cout << t+i+1 << " " << by << " " << bx << endl;
	  break;
	}
      }
    }
  }
}

C++: #include <cstdio>
#include <queue>
using namespace std;

int main(){
	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++;
				if(f[j=b+d[p[i]-'2']]>-3)b=j;
				if(f[b]>=0&&t>=f[b])a=b;
				if(f[b]>=0)z=1;
			}
			if(!z&&!a&&!p[i]&&b==x&&f[b]<0)a=-1;
		}
		printf(a<0?"impossible\n":"%d %d %d\n",t,a/22-1,a%22-1);
	}
}