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));
				}
			}
		}
		bool flag = false;
		for (int i = 0; i < 10000; i++) {
			if (dist[bx][by] <= i) {
				cout << i << ' ' << bx << ' ' << by << endl;
				flag = true; 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;
		}
		if (!flag) cout << "impossible" << endl;
	}
	return 0;
}

C++: #include<iostream>
#include<queue>
using namespace std;
typedef pair<pair<int,int>,int> pa;
#define ff first.first
#define fs first.second
#define mp(a,b,c) make_pair(make_pair(a,b),c)

int h,w,sx,sy,gx,gy,m=999999;
int dx[4]={1,0,-1,0};
int dy[4]={0,-1,0,1};
int co[21][21];
char ma[21][21];
bool visited[21][21];
string pat;

int main(){
    while(cin>>h>>w,h){
        for(int i=0;i<h;i++){
            for(int j=0;j<w;j++){
                co[i][j]=m;
                cin>>ma[i][j];
                if(ma[i][j]=='A')
                    sx=j,sy=i;
                else if(ma[i][j]=='B')
                    gx=j,gy=i;
            }
        }
        queue<pa>q;
        q.push(mp(sx, sy, 0));
        while(q.size()){
            pa p = q.front();
            q.pop();
            if(co[p.fs][p.ff]!=m)
                continue;
            co[p.fs][p.ff]=p.second;
            for(int i=0;i<4;i++){
                int nx=p.ff+dx[i];
                int ny=p.fs+dy[i];
                if(nx>=0&&nx<w&&ny>=0&ny<h&&ma[ny][nx]!='#'&&co[ny][nx]==m)
                    q.push(mp(nx, ny, p.second+1));
            }
        }
        cin>>pat;
        for(int j=0,go=0;int i=j%pat.length();j++,go++){
            if(co[gy][gx]<=go){
                cout<<go<<" "<<gy<<" "<<gx<<endl;
                break;
            }
            if(go>1000000){
                cout<<"impossible"<<endl;
                break;
            }
            if(pat[i]=='8')
                gy--;
            else if(pat[i]=='6')
                gx++;
            else if(pat[i]=='4')
                gx--;
            else if(pat[i]=='2')
                gy++;
            gy=max(0,min(h-1,gy));
            gx=max(0,min(w-1,gx));
        }
    }
}

C++: //35
#include<iostream>
#include<algorithm>
#include<string>
#include<queue>
#include<utility>

using namespace std;

char g[20][20];
int h,w;
int t[20][20];

struct S{
  int t,x,y;
};

int main(){
  while(cin>>h>>w,h|w){
    int ax,ay,bx,by;
    for(int y=0;y<h;y++){
      for(int x=0;x<w;x++){
	cin>>g[y][x];
	if(g[y][x]=='A'){
	  ax=x;
	  ay=y;
	}else if(g[y][x]=='B'){
	  bx=x;
	  by=y;
	}
      }
    }
    fill(t[0],t[20],1<<30);
    queue<S> que;
    S is={0,ax,ay};
    que.push(is);
    while(!que.empty()){
      int x=que.front().x;
      int y=que.front().y;
      int ct=que.front().t;
      que.pop();
      t[y][x]=ct;
      for(int i=0;i<4;i++){
	int d[]={0,1,0,-1,0};
	int nx=x+d[i];
	int ny=y+d[i+1];
	if(nx<0||w<=nx||ny<0||h<=ny||t[ny][nx]<=ct+1||g[ny][nx]=='#')continue;
	S ns={ct+1,nx,ny};
	que.push(ns);
      }
    }
    string p;
    cin>>p;
    int e;
    for(e=0;e<10000;e++){
      if(t[by][bx]<=e)break;
      char o=p[e%p.size()];
      int ny=by+(o=='2')-(o=='8');
      int nx=bx+(o=='6')-(o=='4');
      if(0<=ny&&ny<h&&0<=nx&&nx<w){
	by=ny;
	bx=nx;
      }
    }
    if(e<10000){
      cout<<e<<' '<<by<<' '<<bx<<endl;
    }else{
      cout<<"impossible"<<endl;
    }
  }
  return 0;
}