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 <vector>
#include <algorithm>
#include <string>
#include <cstring>
#include <cstdio>
#include <cmath>
#include <queue>
#include <stack>
#include <map>
#include <set>
#include <bitset>
#include <ctype.h>

#define rep(i, n) for(int i = 0; i < (n); i++)
#define FOR(i, a, b) for(int i = (a); i < (b); i++)
#define all(v) (v).begin(), (v).end()
#define rev(s) (s).rbegin(), (s).rend()
#define MP make_pair
#define X first
#define Y second

using namespace std;

typedef long long ll;
typedef pair<int, int> P;
typedef pair<double, double> dP;

const int INF = 1000000000;
const double EPS = 1e-10;

				//  2      4  5  6      8
int dx[10] = {1,-1, 0, 0, -1, 0, 1, 0,  0, 0};
int dy[10] = {0, 0, 1,-1,  0, 0, 0, 0, -1, 0};

int main(){
	//freopen("test.txt", "r", stdin);
	while(1){
		int h, w;
		cin >> h >> w;
		if(!h && !w) break;
		vector<string> v(h);
		rep(i, h){
			cin >> v[i];
		}
		string pt;
		cin >> pt;

		P a, b;
		rep(i, h){
			rep(j, w){
				if(v[i][j] == 'A') a = MP(j,i);
				if(v[i][j] == 'B') b = MP(j,i);
			}
		}

		queue<P> next;
		next.push(a);
		int cnt = 0;
		while(1){
			queue<P> q = next;
			while(!q.empty()){
				P p = q.front(); q.pop();

				rep(i, 4){
					int x = p.X + dx[i];
					int y = p.Y + dy[i];
					if(x < 0 || x >= w || y < 0 || y >= h) continue;
					if(v[y][x] == '#' || v[y][x] == 'A' ) continue;
					v[y][x] = 'A';
					next.push(MP(x, y));
				}
			}
			int x = b.X + dx[pt[cnt%pt.size()]-'0'];
			int y = b.Y + dy[pt[cnt%pt.size()]-'0'];
			if(x >= 0 && x < w) b.X = x;
			if(y >= 0 && y < h) b.Y = y;
			cnt++;
			if(v[b.Y][b.X] == 'A') break;
			if(cnt > 1000) break;
		}


		if(cnt <= 1000) cout << cnt << ' ' << b.Y << ' ' << b.X << endl;
		else cout << "impossible" << endl;
	}

	return 0;
}

C++: #import<stdio.h>
#import<queue.h>
int main(){
	queue<int> q;
	int w,h,f[484],i,j,d[]={22,0,-1,0,1,0,-22},a,b,t,x,z;
	char p[15];
	for(;scanf("%d%d ",&h,&w),h;){
		for(j=0;j<w+2;j++)f[j]=f[j-~h*22]=-9;
		for(i=1;i<=h;i++){
			for(j=1;j<=w;j++){
				f[x=i*22+j]=-1;
				switch(getchar()){
					case'#':--f[x];break;
					case'A':a=x;break;
					case'B':b=x;break;
				}
			}
			f[i*22]=f[i*22-~w]=-9;
			getchar();
		}
		
		f[a]=t=0;
		q.push(0);
		for(q.push(a);q.size()>1;){
			a=q.front();
			q.pop();
			if(a){
				for(i=0;i<7;i+=2)
					if(f[x=a+d[i]]==-1)
						f[x]=t,
						q.push(x);
					else
						++t,q.push(0);
			}
		}
		q.pop();
		scanf("%s",p);
		for(a=t=0;!a;){
			x=b;
			z=0;
			for(i=0;!a&&p[i];i++){
				t++;
				f[j=b+d[p[i]-'2']]>-3?b=j:0;
				f[b]>=0&&t>=f[b]?a=b:0;
				f[b]>=0&&++z;
			}
			!z&!a&!p[i]&b==x&f[b]<0&&--a;
		}
		printf(a<0?"impossible\n":"%d %d %d\n",t,a/22-1,a%22-1);
	}
}

C++: #include <bits/stdc++.h>

using namespace std;

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

#define REP(i,n) for(ll i=0;i<n;i++)
#define FOR(i,a,b) for(ll i=a;i<b;i++)

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

int h, w, ax, ay, bx, by, t, flag;
char field[20][20];
char pattern[10];

int main() {

	while(true) {

		scanf("%d%d", &h, &w);

		if (h == 0 && w == 0) break;

		REP(y,h) {
			scanf("%s", field[y]);
			REP(x,w) {
				if (field[y][x] == 'A') {
					ax = x;
					ay = y;
				} else if (field[y][x] == 'B') {
					bx = x;
					by = y;
				}
			}
		}

		scanf("%s", pattern);

		int leng = strlen(pattern);

		t = 0, flag = 0;

		queue<pii> q, nq;
		q.push(pii(ax,ay));

		REP(i,200) {
			t++;

			// girl
			while(!q.empty()) {
				pii p = q.front();
				q.pop();
				REP(j,4) {
					int nx = p.first + dx[j];
					int ny = p.second + dy[j];
					if (0<=nx&&nx<w && 0<=ny&&ny<h && field[ny][nx]!='#') {
						field[ny][nx] = 'A';
						nq.push(pii(nx,ny));
					}
				}
			}
			while(!nq.empty()) {
				q.push(nq.front());
				nq.pop();
			}

			// ghost
			switch(pattern[i%leng]) {
				case '5':
				break;
				case '8':
				by--;
				if(by<0)by=0;
				break;
				case '6':
				bx++;
				if(bx>=w)bx=w-1;
				break;
				case '4':
				bx--;
				if(bx<0)bx=0;
				break;
				case '2':
				by++;
				if(by>=h)by=h-1;
				break;	
			}

			if (field[by][bx] == 'A') {
				flag = 1;
				break;
			}
		}

		if (flag == 0) {
			printf("impossible\n");
		} else {
			printf("%d %d %d\n", t, by, bx);
		}

	}

	return 0;

}