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<vector>
#include<stack>
#include<map>
#include<set>
#include<queue>
#include<cstdio>
#include<climits>
#include<cmath>
#include<cstring>
#include<string>
#include<sstream>
#include<numeric>

#define f first
#define s second
#define mp make_pair

#define REP(i,n) for(int i=0; i<(int)(n); i++)
#define FOR(i,c) for(__typeof((c).begin()) i=(c).begin(); i!=(c).end(); i++)
#define ALL(c) (c).begin(), (c).end()

using namespace std;

typedef unsigned int uint;
typedef long long ll;

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

const int gdx[10] = {
  0,
  0,0,0,
  -1,0,1,
  0,0,0
};

const int gdy[10] = {
  0,
  0,1,0,
  0,0,0,
  0,-1,0
};

int main(){
  int h,w;
  while(scanf("%d%d ",&h,&w), h+w){
    char buff[h][w+3];
    int dist[h][w];
    int mx,my,gx,gy;

    REP(i,h) fgets(buff[i],sizeof(buff[i]),stdin);
    REP(i,h){
      REP(j,w){
        dist[i][j] = -1;
        if(buff[i][j] == 'A'){
          mx = j; my = i;
          buff[i][j] = '.';
        }else if(buff[i][j] == 'B'){
          gx = j; gy = i;
          buff[i][j] = '.';
        }
      }
    }

    queue<pair<int,int> > q;
    q.push(mp(mx,my)); dist[mx][my]=0;
    int last = 0;
    while(!q.empty()){
      int x = q.front().f;
      int y = q.front().s;
      q.pop();

      REP(i,4){
        int xx = x + dx[i];
        int yy = y + dy[i];
        if(xx < 0 || yy < 0) continue;
        if(xx >=w || yy >=h) continue;
        if(buff[yy][xx] == '#') continue;
        if(dist[yy][xx] != -1) continue;
        last = dist[yy][xx] = dist[y][x] + 1;
        q.push(mp(xx,yy));
      }
    }

    //REP(i,h){ REP(j,w) printf("  %c",buff[i][j]); puts("");}
    //REP(i,h){ REP(j,w) printf("%3d",dist[i][j]); puts("");}

    char pat[20];
    fgets(pat,sizeof(pat),stdin);
    int plen = strlen(pat);
    if(pat[plen-1] == '\n') plen--;
    bool flag[h][w][plen]; memset(flag, 0, sizeof(flag));
    int turn = 0;
    while(true){
      int pp = pat[turn % plen] - '0'; turn++;
      int xx = gx + gdx[pp];
      int yy = gy + gdy[pp];

      if(xx < 0 || yy < 0 || xx >=w || yy >=h){
        xx = gx; yy = gy;
      }

      //printf("goast: (%d,%d) pp=%d\n",xx,yy,pp);

      if(dist[yy][xx] != -1 && dist[yy][xx] <= turn){
        printf("%d %d %d\n",turn,yy,xx);
        break;
      }

      if(flag[yy][xx][turn % plen]){
        puts("impossible");
        break;
      }

      if(turn >= last + last)
        flag[yy][xx][turn % plen] = true;

      gx = xx; gy = yy;
    }

  }
  return 0;
}

C++: #include<iostream>
#include<algorithm>
#include<string>
#include<cstring>
#include<cstdlib>
#include<queue>
#include<vector>
#include<map>
#include<cmath>
#include<list>
#include<set>
using namespace std;
#define fr first
#define sc second
#define INFTY 1000000
typedef pair< int,int > Pt;
typedef pair< pair<Pt,Pt>,int > P;
Pt A,B;
int h,w,dx[]={0,1,0,-1,0},dy[]={1,0,-1,0,0};
char mas[20][20];
int used[20][20][20][20][11];
string pattern;
pair<int,Pt> bfs();
bool judge(int,int);
int main(){
  while(cin >> h >> w && h){
    for(int i=0;i<h;i++){
      for(int j=0;j<w;j++){
        cin >> mas[i][j];
        if(mas[i][j] == 'A') A = Pt(i,j);
        else if(mas[i][j] == 'B') B = Pt(i,j);
      }
    }
    cin >> pattern;
    pair<int,Pt> ans = bfs();
    if(ans.fr == -1) cout << "impossible" << endl;
    else cout << ans.fr << " " << ans.sc.fr << " " << ans.sc.sc << endl;
  }
}
pair<int,Pt> bfs(){
  map<char,int> tmp;
  tmp['5'] = 4,tmp['8'] = 3,tmp['6'] = 0,tmp['4'] = 2,tmp['2'] = 1;
  queue<P> que;
  memset(used,-1,sizeof(used));
  que.push(P(make_pair(A,B),-1));
  while(!que.empty()){
    P p = que.front();
    que.pop();
    if(p.fr.fr == p.fr.sc){
      return (make_pair(used[p.fr.fr.fr][p.fr.fr.sc][p.fr.sc.fr][p.fr.sc.sc][p.sc]+1,Pt(p.fr.fr.fr,p.fr.fr.sc)));
    }
    int cnt = (p.sc + 1) % pattern.size();
    int bx = p.fr.sc.fr + dx[tmp[pattern[cnt]]];
    int by = p.fr.sc.sc + dy[tmp[pattern[cnt]]];
    if(!judge(bx,by)) bx = p.fr.sc.fr , by = p.fr.sc.sc;
    for(int i=0;i<5;i++){
      int ax = p.fr.fr.fr + dx[i] , ay = p.fr.fr.sc + dy[i];
      if(!judge(ax,ay) || mas[ax][ay] == '#') ax = p.fr.fr.fr , ay = p.fr.fr.sc;
      if(used[ax][ay][bx][by][cnt] == -1){
        que.push(P(make_pair(Pt(ax,ay),Pt(bx,by)),cnt));
        used[ax][ay][bx][by][cnt] = used[p.fr.fr.fr][p.fr.fr.sc][p.fr.sc.fr][p.fr.sc.sc][p.sc] + 1;
      }
    }
  }
  return make_pair(-1,Pt(0,0));
}
bool judge(int x,int y){
  return (x >= 0 && x < h && y >= 0 && y < w ? true : false);
}