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<climits>
#include<vector>
#include<queue>
#include<stack>
#include<cmath>
#include<string.h>

using namespace std;

int h,w,sx,sy,gx,gy;
int dx[4]={1,0,-1,0};
int dy[4]={0,-1,0,1};

char ma[21][21];
int co[21][21];
bool visited[21][21];

int main(){
    while(cin>>h>>w,h){
        for(int i=0;i<h;i++){
            for(int j=0;j<w;j++){
                co[i][j]=INT_MAX;
                cin>>ma[i][j];
                if(ma[i][j]=='A'){
                    sx=j,sy=i;
                } else if(ma[i][j]=='B'){
                    gx=j,gy=i;
                }
            }
        }
        memset(visited, 0, sizeof(visited));
        queue<pair<pair<int,int>,int> >q;
        q.push(make_pair(make_pair(sx, sy), 0));
        while(q.size()){
            pair<pair<int,int>,int> p = q.front();
            visited[p.first.second][p.first.first]=1;
            co[p.first.second][p.first.first]=p.second;
           // cout<<p.first.second<<"  "<<p.first.first<<"  "<<p.second<<endl;
            q.pop();
            for(int i=0;i<4;i++){
                int nx=p.first.first+dx[i];
                int ny=p.first.second+dy[i];
                if(nx>=0&&nx<w&&ny>=0&ny<h&&ma[ny][nx]!='#'&&co[ny][nx]==INT_MAX&&ma[ny][nx]!='A'&&!visited[ny][nx]){
                    q.push(make_pair(make_pair(nx, ny), p.second+1));
                }
            }
        }
        string pat;
        cin>>pat;
        int go=0;
        for(int j=0;;j++){
            int i=j%pat.length();
         //   cout<<gy<<" "<<gx<<" "<<co[gy][gx]<<" "<<INT_MAX<<endl;
            if(co[gy][gx]<=go){
                cout<<go<<" "<<gy<<" "<<gx<<endl;
                break;
            }
            if(go>10000000){
                cout<<"impossible"<<endl;
                break;
            }
            if(pat[i]=='5'){
                
            } else 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,gy);
            gy=min(h-1,gy);
            gx=max(0,gx);
            gx=min(w-1,gx);
            go++;
        }
    }
}

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

const int inf = 1<<29;
#define rep(i,n) for(i=0; i<n; ++i)

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

void bfs(const vector<vector<bool> > &grid,vector< vector<int> > &dist,
	 pair<int,int> start) {
  int i;
  dist[start.first][start.second] = 0;
  queue<pair<int,int> > Q;
  Q.push(start);
  while(!Q.empty()) {
    pair<int,int> now = Q.front(); Q.pop();
    int nx = now.second,ny = now.first;
    rep(i,4) {
      if(nx+dx[i] >= 0 && nx+dx[i] < grid[0].size() &&
	 ny+dy[i] >= 0 && ny+dy[i] < grid.size() &&
	 grid[ny+dy[i]][nx+dx[i]] == true && dist[ny+dy[i]][nx+dx[i]] == inf) {
	dist[ny+dy[i]][nx+dx[i]] = dist[ny][nx]+1;
	Q.push(make_pair(ny+dy[i],nx+dx[i]));
      }
    }
  }
  return;
}

int main() {
  int h,w,i,j,k;
  string s,pattern;
  while(cin>>h>>w, h|w) {
    vector< vector<bool> > grid(h, vector<bool>(w, true));
    vector< vector<int> > dist(h, vector<int>(w, inf));
    pair<int,int> start,ghost;
    rep(i,h) {
      cin>>s;
      rep(j,w) {
	if(s[j] == 'A') start = make_pair(i,j);
	if(s[j] == 'B') ghost = make_pair(i,j);
	if(s[j] == '#') grid[i][j] = false;
      }
    }
    cin>>pattern;
    bfs(grid,dist,start);
    int pat = pattern.length();
    bool possible = false;

    rep(i, h*w+h*w*pat+2) {
      if(dist[ghost.first][ghost.second] <= i) {
	cout<<i<<" "<<ghost.first<<" "<<ghost.second<<endl;
	goto NEXT;
      }
      int d = i%pat;
      if(pattern[d] == '8') {
	ghost.first--;
	if(ghost.first < 0) ghost.first = 0;
      }else if(pattern[d] == '2') {
	ghost.first++;
	if(ghost.first >= h) ghost.first = h-1;
      }else if(pattern[d] == '6') {
	ghost.second++;
	if(ghost.second >= w) ghost.second = w-1;
      }else if(pattern[d] == '4') {
	ghost.second--;
	if(ghost.second < 0) ghost.second = 0;
      }
    }
    cout<<"impossible"<<endl;
  NEXT:;

  }
}