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<deque>
#include<list>
#include<map>
#include<queue>
#include<set>
#include<stack>
#include<vector>
#include<algorithm>
#include<string>
#include<iostream>
#include<sstream>
#include<cmath>
#include<cstdlib>
#include<cstdio>
#include<cstring>
using namespace std;
int main(){
  int i,j,k;
  int h,w;
  while(cin>>h>>w,h||w){
    int a[22][22],sx,sy,tx,ty;
    memset(a,-1,sizeof(a));
    for(i=1;i<h+1;i++){
      for(j=1;j<w+1;j++){
	char s;
	cin>>s;
	if(0){
	}else if(s=='#'){
	  a[j][i]=-2;
	}else{
	  a[j][i]=-3;
	  if(0){
	  }else if(s=='A'){
	    sx=j;
	    sy=i;
	  }else if(s=='B'){
	    tx=j;
	    ty=i;
	  }
	}
      }
    }
    string s;
    cin>>s;
    int ln=s.length();
    queue<pair<pair<int,int>,int> > b;
    b.push(make_pair(make_pair(sx,sy),0));
    while(b.empty()==0){
      int x,y,z;
      x=b.front().first.first;
      y=b.front().first.second;
      z=b.front().second;
      b.pop();
      if(a[x][y]==-3){
	a[x][y]=z;
	b.push(make_pair(make_pair(x-1,y),z+1));
	b.push(make_pair(make_pair(x+1,y),z+1));
	b.push(make_pair(make_pair(x,y-1),z+1));
	b.push(make_pair(make_pair(x,y+1),z+1));
      }
    }
    int x=tx,y=ty;
    int c[22][22][10],d[22][22][10];
    memset(c,-1,sizeof(c));
    memset(d,-1,sizeof(d));
    c[x][y][ln-1]=0;
    int mn=1<<30,xmn,ymn;
    j=0;
    for(;;){
      for(i=0;i<ln;i++){
	j++;
	if(0){
	}else if(s[i]=='5'){
	}else if(s[i]=='8'){
	  if(a[x][y-1]!=-1)
	    y--;
	}else if(s[i]=='6'){
	  if(a[x+1][y]!=-1)
	    x++;
	}else if(s[i]=='4'){
	  if(a[x-1][y]!=-1)
	    x--;
	}else if(s[i]=='2'){
	  if(a[x][y+1]!=-1)
	    y++;
	}
	if(c[x][y][i]==-1){
	  c[x][y][i]=j;
	  if(a[x][y]>=0&&a[x][y]<=j){
	    if(mn>j){
	      mn=j;
	      xmn=x-1;
	      ymn=y-1;
	    }
	  }
	}else{
	  if(d[x][y][i]){
	    d[x][y][i]=0;
	    if(a[x][y]>=0&&a[x][y]>c[x][y][i]){
	      for(k=0;a[x][y]>c[x][y][i]+ln*k;k++);
	      if(mn>c[x][y][i]+ln*k){
		mn=c[x][y][i]+ln*k;
		xmn=x-1;
		ymn=y-1;
	      }
	    }
	  }else{
	    break;
	  }
	}
      }
      if(i!=ln)
	break;
    }
    if(mn==1<<30)
      cout<<"impossible"<<endl;
    else
      cout<<mn<<" "<<ymn<<" "<<xmn<<endl;
  }
  return 0;
}