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<queue>
using namespace std;
typedef pair<pair<int,int>,int> pa;
#define ff first.first
#define fs first.second

int h,w,sx,sy,gx,gy;
int dx[4]={1,0,-1,0};
int dy[4]={0,-1,0,1};
int co[21][21];
char ma[21][21];
bool visited[21][21];
string pat;
int m = 99999;

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

C++: #include <iostream>
#include <string>
#include <queue>
#include <tuple>
#include <cstdio>
using namespace std;
typedef tuple<int, int, int> T;

int h, w;
string s[20];
int meY, meX;
int gostY, gostX;
string moves;

int minCost[20][20];
int INF = 1000;

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

void outAns() {
	int y = gostY;
	int x = gostX;
	
	for (int i = 0; i < INF; i++) {
		if (minCost[y][x] <= i) {
			cout << i << " " << y << " " << x << endl;
			return;
		}
		
		char type = moves[i % moves.length()];
		string dir = "8624";
		int j;
		for (j = 0; j < 4; j++) {
			if (dir[j] == type) {
				break;
			}
		}
		if (j == 4) continue;
		
		//?????? == j??§?§????
		int ny = y + dy[j];
		int nx = x + dx[j];
		if (0 <= ny && ny < h && 0 <= nx && nx < w) {
			y = ny;
			x = nx;
		}
	}
	cout << "impossible" << endl;
}

int main() {
	while (cin >> h >> w, h) {
		int i, j;
		for (i = 0; i < h; i++) cin >> s[i];
		for (i = 0; i < h; i++) {
			for (j = 0; j < w; j++) {
				if (s[i][j] == 'A') {
					meY = i;
					meX = j;
				}
				if (s[i][j] == 'B') {
					gostY = i;
					gostX = j;
				}
			}
		}
		cin >> moves;
		
		for (i = 0; i < h; i++) for (j = 0; j < w; j++) minCost[i][j] = INF;
		
		queue<T> que;	//cst, y, x
		que.push(T(0, meY, meX));
		while (!que.empty()) {
			T now = que.front(); que.pop();
			int cst = get<0>(now);
			int y = get<1>(now);
			int x = get<2>(now);
			if (minCost[y][x] <= cst) continue;
			minCost[y][x] = cst;
			
			for (int i = 0; i < 4; i++) {
				int ny = y + dy[i];
				int nx = x + dx[i];
				if (!(0 <= ny && ny < h && 0 <= nx && nx < w)) continue;
				if (s[ny][nx] == '#') continue;
				que.push(T(cst + 1, ny, nx));
			}
		}
		
		outAns();
	}
	return 0;
}

C++: #include "bits/stdc++.h"

using namespace std;

typedef vector<int> vi;
typedef pair<int,int> pii;
typedef long long ll;

#define rep(i,n) for(ll i=0;i<(ll)(n);i++)
#define all(a)  (a).begin(),(a).end()
#define pb push_back

vector<string> data(20);
int dist[20][20]={};
bool visited[20][20];
int h,w;


void dfs(int y,int x){
	if( y<0 || y>=h || x<0 || x>=w || visited[y][x]==true || data[y][x]=='#' )return ;

	visited[y][x]=true;

	int a = (y+1<h )?dist[y+1][x]:999999999;
	int b = (y-1>=0)?dist[y-1][x]:999999999;
	int c = (x+1<w )?dist[y][x+1]:999999999;
	int d = (x-1>=0)?dist[y][x-1]:999999999;

	dist[y][x]=min( dist[y][x] , min(min(a,b) , min(c,d))+1 );

	dfs(y+1,x);
	dfs(y-1,x);
	dfs(y,x+1);
	dfs(y,x-1);
}
int main(){
	while(cin>>h>>w){
		if(h==0&&w==0)break;
		data.clear();
		rep(i,20)rep(j,20){dist[i][j]=999999999;visited[i][j]=false;}
		string move;

		rep(i,h) cin>>data[i];
		cin>>move;		

		int sx,sy,gx,gy;
		rep(i,h)rep(j,w){
			if(data[i][j]=='A'){ sy=i;sx=j; }
			if(data[i][j]=='B'){ gy=i;gx=j;data[i][j]='.'; }
		}

		dist[sy][sx]=0;
		dfs(sy,sx);

		for(int i=0;;i++){
			if(dist[gy][gx]<=i){
				cout<<i<<" "<<gy<<" "<<gx<<endl;
				break;
			}
			if(move[i%move.size()]=='5'){;					}
			if(move[i%move.size()]=='8'){gy=max(0,gy-1);	}
			if(move[i%move.size()]=='6'){gx=min(w-1,gx+1);	}
			if(move[i%move.size()]=='4'){gx=max(0,gx-1);	}
			if(move[i%move.size()]=='2'){gy=min(h-1,gy+1);	}
			if(i==1000000){
				cout<<"impossible"<<endl;
				break;
			}

		}

	}
	return 0;
}