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<cstdio>
#include<iostream>
#include<queue>
#include<string>
#include<limits.h>
#define N 100

using namespace std;
struct Point{int y, x;};

int Calc[N][N],H,W,SaveX[1],SaveY[1];
char Input[N][N];
string Action;

int BFS();


int main(){
  int i,j,Ghostcount=0,Ghost=0,GSaveX[1],GSaveY[1],ImpossibleCount=0,flag=0,ImpossibleSaveX,ImpossibleSaveY;

  while(1){

  cin >> H >> W;
  if(H == 0 && W == 0)break;





  for(i=0;i<H;i++){
    for(j=0;j<W;j++){
      cin >> Input[i][j];
      if(Input[i][j] == 'A'){
        Calc[i][j]=0;
        SaveX[0]=j;
        SaveY[0]=i;
      }
      else if(Input[i][j] == '#')Calc[i][j]=-1;
      else if(Input[i][j] == '.' )Calc[i][j]=INT_MAX;
      else if(Input[i][j] == 'B'){
        Calc[i][j]=INT_MAX;
        GSaveX[0]=j;
        GSaveY[0]=i;
      }
    }
  }
  
 
  cin >> Action;

    Ghostcount=Action.length();     
    /* cout << Ghostcount <<"--Ghostcount" <<endl; */
   
  

  

  BFS();
  /*
  cout << endl;
  
  cout << "Input" << endl;
  for(i=0;i<H;i++){
    for(j=0;j<W;j++){
      printf("%c ",Input[i][j]);
    }
    cout << endl;
  }

  cout << endl;  

  cout << "Calc" << endl;
  for(i=0;i<H;i++){
    for(j=0;j<W;j++){
      printf("%d ",Calc[i][j]);
    }
    cout << endl;
  }
  
  cout << endl;
*/

  Ghost=0;
 
  ImpossibleSaveX = GSaveX[0]; 
  ImpossibleSaveY = GSaveY[0];
  /* cout << "úÌImpossibleSaveY--" << ImpossibleSaveY << endl;
     cout << "úÌImpossibleSaveX--" << ImpossibleSaveX << endl;*/
 
  i=0;
  while(1){
    if(Action[i] == '8'){
      if(GSaveY[0]-1 < 0){}
      else{GSaveY[0]=GSaveY[0]-1;}
}
    else if(Action[i] == '4'){
      if(GSaveX[0]-1 < 0 ){}
      else{GSaveX[0]=GSaveX[0]-1;}
} 
    else if(Action[i] == '2'){
      if(GSaveY[0]+1 > H-1){}
      else{GSaveY[0]=GSaveY[0]+1;}
} 
    else if(Action[i] == '6'){
      if(GSaveX[0]+1 > W-1){}
      else{GSaveX[0]=GSaveX[0]+1;}
}
    else if(Action[i] == '5'){}
    /* cout << "GSaveY[0]--" << GSaveY[0] << endl;
       cout << "GSaveX[0]--" << GSaveX[0] << endl; */
    Ghost+=1;

    
    /* cout << "i:"<<i << " " << "Action["<<i<<"]:" << Action[i] << endl;
   
       cout << "Ghost--" << Ghost << endl;*/

    if((Ghost >= Calc[GSaveY[0]][GSaveX[0]]) && Calc[GSaveY[0]][GSaveX[0]] != -1 ){
      if(Calc[GSaveY[0]][GSaveX[0]] == 0){ cout << Ghost << " " << GSaveY[0] << " " << GSaveX[0] << endl;}
      else{ cout << Ghost << " " << GSaveY[0] << " " << GSaveX[0] << endl;}
      break;
    }

    if((Calc[GSaveY[0]][GSaveX[0]] != -1) && (Calc[GSaveY[0]][GSaveX[0]] != INT_MAX))flag=1;  /*ålöªÊêéÆ±ëª êÎtOON*/
       

    /*
    if(){
      cout << "impossible" << endl;
      break; 
    }    
    */

    
    if(Ghostcount == i){
      if( (GSaveY[0] == ImpossibleSaveY) &&(GSaveX[0] == ImpossibleSaveX) &&  (Calc[GSaveY[0]][GSaveX[0]] == -1 || Calc[GSaveY[0]][GSaveX[0]] == INT_MAX) && flag == 0){ 
	/*	cout << "Calc[GSaveY[0]][GSaveX[0]] --" << Calc[GSaveY[0]][GSaveX[0]] << endl;
		cout << "Calc[ImpossibleSaveY][ImpossibleSaveX]--" << Calc[ImpossibleSaveY][ImpossibleSaveX]  << endl;*/

	cout << "impossible" << endl;
	break;
      }
      ImpossibleSaveY = GSaveY[0];
      ImpossibleSaveX = GSaveX[0];
     /* cout << "ImpossibleSaveY--" << ImpossibleSaveY << endl;
	cout << "ImpossibleSaveX--" << ImpossibleSaveX << endl; */
      i=0;
      flag=0;
      
    }

    


    i++;

   
    
    if(Ghostcount == i){
      if( (GSaveY[0] == ImpossibleSaveY) &&(GSaveX[0] == ImpossibleSaveX) &&  (Calc[GSaveY[0]][GSaveX[0]] == -1 || Calc[GSaveY[0]][GSaveX[0]] == INT_MAX) && flag == 0){ 
	/*	cout << "Calc[GSaveY[0]][GSaveX[0]] --" << Calc[GSaveY[0]][GSaveX[0]] << endl;
		cout << "Calc[ImpossibleSaveY][ImpossibleSaveX]--" << Calc[ImpossibleSaveY][ImpossibleSaveX]  << endl; */

	cout << "impossible" << endl;
	break;
      }
      ImpossibleSaveY = GSaveY[0];
      ImpossibleSaveX = GSaveX[0];
      /* cout << "ImpossibleSaveY--" << ImpossibleSaveY << endl;
	 cout << "ImpossibleSaveX--" << ImpossibleSaveX << endl; */
      i=0;
      flag=0;
      
    }

    




   
  }



  }
  
  

  return 0;
}





int BFS(){
  Point u,v;
  queue<Point> Q;
  int ny,nx;
  int dy[4]={0,-1,0,1};
  int dx[4]={1,0,-1,0};

  u.y=SaveY[0];
  u.x=SaveX[0];
  Calc[u.y][u.x]=0; 
  Q.push(u);

  while(!Q.empty()){
    u= Q.front();
    Q.pop();
    /*if(u.y == H-1 && u.x == W-1) return Calc[u.y][u.x];*/
    for(int r=0 ; r<4 ; r++ ){
      nx = u.x + dx[r];
      ny = u.y + dy[r];
      if(  nx < 0 || ny < 0 || ny >= H || nx >= W )continue;
          if(Calc[ny][nx] != INT_MAX ) continue;
          if(Calc[ny][nx] == -1)continue; 
          Calc[ny][nx] = Calc[u.y][u.x] + 1;
          v.x = nx;
          v.y = ny;
          Q.push(v);
          }
    }

    return -1;

}