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;
char ma[21][21];
int sx,sy;
int gx,gy;
int co[21][21];
int dx[4]={1,0,-1,0};
int dy[4]={0,-1,0,1};

int main(){
    cin>>h>>w;
    memset(co,0,sizeof(co));
    for(int i=0;i<h;i++){
        for(int j=0;j<w;j++){
            cin>>ma[i][j];
            if(ma[i][j]=='A'){
                sx=j,sy=i;
            } else if(ma[i][j]=='B'){
                gx=j,gy=i;
            } else if(ma[i][j]=='#'){
                co[i][j]=INT_MAX;
            }
        }
    }
    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();
        co[p.first.second][p.first.first]=p.second;
        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]==0){
                q.push(make_pair(make_pair(nx, ny), p.second));
            }
        }
    }
    string pat;
    cin>>pat;
    int visited[21][21];
    memset(visited, 0, sizeof(visited));
    int go=0;
    for(int i=0;;i=(i+1)%pat.length()){
        if(visited[gy][gx]==i){
            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);
        if(co[gy][gx]<=go){
            cout<<go<<endl;
            break;
        }
        go++;
        visited[gy][gx]=i;
    }
}

C++: #include <stdio.h>
#include <cctype>
#include <limits.h>
#include <math.h>
#include <complex>
#include <bitset>
#include <vector>
#include <map>
#include <set>
#include <stack>
#include <queue>
#include <cstring>
#include <string>
#include <sstream>
#include <algorithm>
#include <iomanip>
#include <iostream>

#define VARIABLE(x) cerr << #x << "=" << x << endl
#define BINARY(x) static_cast<bitset<16> >(x);
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define REP(i,m,n) for (int i=m;i<(int)(n);i++)
#define if_range(x, y, w, h) if (0<=(int)(x) && (int)(x)<(int)(w) && 0<=(int)(y) && (int)(y)<(int)(h))

const int INF = 1000000000;
const double EPS = 1e-8;
const double PI = 3.14159;
//int dx[4]={-1, 0, 1, 0}, dy[4]={0, -1, 0, 1};
using namespace std;
//typedef pair<int, int> P;

/** Problem1046 : Ghost Buster! **/
int dx[]={-1, 0, 1, 0, 0}, dy[]={0, -1, 0, 1, 0};

int W, H;
string s;

struct P {
	int x, y;
	P(){}
	P(int _x, int _y) : x(_x), y(_y) {}
};

struct S {
	P p;
	int time;
	S(){}
	S(P _p, int _time) : p(_p), time(_time) {}
};

typedef pair<S, S> SS;

int main()
{
	
	while (cin>>H>>W, W||H) {
		char field[20][20];
		
		S A, B;
		
		rep(i, H) rep(j, W) {
			cin>>field[i][j];
			if (field[i][j] == 'A')
				A = S(P(j, i), 0);
			else if (field[i][j] == 'B')
				B = S(P(j, i), 0);
		}
		cin>>s;
		int N = (int)s.size();
		
		queue<SS> Q;
		bool vis[H][W][H][W][10];
		memset(vis, 0, sizeof(vis));
		
		Q.push(SS(A, B));
		vis[A.p.y][A.p.x][B.p.y][B.p.x][0] = true;
		
		while (Q.size()) {
			SS ss = Q.front(); Q.pop();
			S a = ss.first, b = ss.second;

			//cerr << "(" << a.p.x << ", " << a.p.y << ")" << " ";
			//cerr << "(" << b.p.x << ", " << b.p.y << ")" << " " << a.time << endl;
			
			if (a.p.x == b.p.x && a.p.y == b.p.y) {
				cout << a.time << " " << a.p.y << " " << a.p.x << endl;
				goto end;
			}
						
			// Move Ghost
			if (s[b.time%N] == '8' && b.p.y>0)
				b.p.y--;
			else if (s[b.time%N] == '6' && b.p.x<W-1)
				b.p.x++;
			else if (s[b.time%N] == '4' && b.p.x>0)
				b.p.x--;
			else if (s[b.time%N] == '2' && b.p.y<H-1)
				b.p.y++;
			b.time++;
			
			// Move Girl
			a.time++;
			rep(i, 5) {
				int nx = a.p.x + dx[i], ny = a.p.y + dy[i];
				if_range(nx, ny, W, H) {
					if (!vis[ny][nx][b.p.y][b.p.x][a.time%N] && field[ny][nx] != '#') {
						Q.push(SS(S(P(nx, ny), a.time), b));
						vis[ny][nx][b.p.y][b.p.x][a.time%N] = true;
					}
				}
			}
			
			if (!vis[a.p.y][a.p.x][b.p.y][b.p.x][b.time%N]) {
				Q.push(SS(a, b));
				vis[a.p.y][a.p.x][b.p.y][b.p.x][b.time%N] = true;
			}
		}
		cout << "impossible" << endl;
	end:;
	}
}