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 <sstream>
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <ctime>
#include <cstring>
#include <string>
#include <vector>
#include <stack>
#include <queue>
#include <deque>
#include <map>
#include <set>
#include <bitset>
#include <numeric>
#include <utility>
#include <iomanip>
#include <algorithm>
#include <functional>
using namespace std;

typedef long long ll;
typedef vector<int> vint;
typedef vector<long long> vll;
typedef pair<int,int> pint;
typedef pair<long long, long long> pll;

#define MP make_pair
template<class T1, class T2> ostream& operator << (ostream &s, pair<T1,T2> P) 
{ return s << P.first << " " << P.second; }

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

int n, m;
char fi[25][25];
string pat;

int dist[25][25][25][25][11];

pair<int,pint> solve() {
    pint s, t;
    for (int i = 0; i < n; ++i) for (int j = 0; j < m; ++j) {
        cin >> fi[i][j];
        if (fi[i][j] == 'A') s = pint(i,j);
        if (fi[i][j] == 'B') t = pint(i,j);
    }
    cin >> pat;
    memset(dist, -1, sizeof(dist));
    dist[s.first][s.second][t.first][t.second][0] = 0;
    queue< pair<pair<pint,pint>,int> > que;
    que.push( MP(MP(s,t),0) );
    while (!que.empty()) {
        pint girl = que.front().first.first;
        pint goast = que.front().first.second;
        int p = que.front().second;
        //cout << girl << ", " << goast << " : " << dist[girl.first][girl.second][goast.first][goast.second] << endl;
        que.pop();
        if (girl == goast) { 
            return MP(dist[girl.first][girl.second][goast.first][goast.second][p], girl); 
        }
        
        pint ngoast = goast;
        char c = pat[p];
        if (c == '8') ngoast = pint(goast.first-1, goast.second);
        if (c == '6') ngoast = pint(goast.first, goast.second+1);
        if (c == '4') ngoast = pint(goast.first, goast.second-1);
        if (c == '2') ngoast = pint(goast.first+1, goast.second);
        if (ngoast.first < 0 || ngoast.first >= n || ngoast.second < 0 || ngoast.second >= m) ngoast = goast;
        int np = (p+1)%pat.size();
        
        for (int i = 0; i < 5; ++i) {
            pint ngirl = girl;
            if (i < 4) ngirl = pint( girl.first + dx[i], girl.second + dy[i] );
            if (ngirl.first < 0 || ngirl.first >= n || ngirl.second < 0 || ngirl.second >= m) continue;
            if (fi[ngirl.first][ngirl.second] == '#') continue;
            if ( dist[ngirl.first][ngirl.second][ngoast.first][ngoast.second][np] == -1 ) {
                dist[ngirl.first][ngirl.second][ngoast.first][ngoast.second][np] 
                = dist[girl.first][girl.second][goast.first][goast.second][p] + 1;
                que.push( MP(MP(ngirl, ngoast),np) );
            }
        }
    }
    return MP(-1,pint(-1,-1));
}

int main() {
    while (cin >> n >> m) {
        if (n == 0) break;
        pair<int,pint> res = solve();
        if (res.first == -1) puts("impossible");
        else cout << res << endl;
    }
    return 0;
}