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 <string>
#include <vector>
#include <set>
#include <map>
#include <stack>
#include <queue>
#include <algorithm>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <climits>
using namespace std;

typedef pair <int, int> PII;
typedef pair <PII, PII> PPP;
typedef pair <int, PPP> NODE;
typedef priority_queue <NODE, vector<NODE>, greater<NODE> > QUEUE;
typedef vector <string> VS;

bool V[21][21][21][21][11];

void solve( int w, int h ) {
    VS M(h);
    for ( int i = 0; i < h; ++ i ) {
        cin >> M[i];
    }
    int sr, sc, gr, gc;
    for ( int i = 0; i < h; ++ i ) {
        for ( int j = 0; j < w; ++ j ) {
            if ( M[i][j] == 'A' ) {
                sr = i;
                sc = j;
            }
            if ( M[i][j] == 'B' ) {
                gr = i;
                gc = j;
            }
        }
    }
    string s;
    cin >> s;
    int n = s.size();
    QUEUE Q;
    NODE start( 0, PPP( PII( sr, sc ), PII( gr, gc ) ) );
    Q.push( start );
    for ( int i = 0; i < 21; ++ i ) {
        for ( int j = 0; j < 21; ++ j ) {
            for ( int k = 0; k < 21; ++ k ) {
                for ( int l = 0; l < 21; ++ l ) {
                    for ( int m = 0; m < 11; ++ m ) {
                        V[i][j][k][l][m] = false;
                    }
                }
            }
        }
    }

    while ( ! Q.empty() ) {
        NODE node = Q.top();
        Q.pop();

        int cost = node.first;
        int r1 = node.second.first.first;
        int c1 = node.second.first.second;
        int r2 = node.second.second.first;
        int c2 = node.second.second.second;
        if ( r1 == r2 && c1 == c2 ) {
            cout << cost << " " << r1 << " " << c1 << endl;
            return;
        }
        
        int ncost = cost + 1;
        int nr2 = r2;
        int nc2 = c2;
        if ( s[cost%n] == '8' ) {
            nr2 --;
        } else if ( s[cost%n] == '2' ) {
            nr2 ++;
        } else if ( s[cost%n] == '6' ) {
            nc2 ++;
        } else if ( s[cost%n] == '4' ) {
            nc2 --;
        }
        if ( nr2 < 0 || nr2 >= h ) nr2 = r2, nc2 = c2;
        if ( nc2 < 0 || nc2 >= w ) nr2 = r2, nc2 = c2;

        const int dr[5] = { 0, 0, 1, -1, 0 };
        const int dc[5] = { 1, -1, 0, 0, 0 };
        for ( int k = 0; k < 5; ++ k ) {
            int nr1 = r1 + dr[k];
            int nc1 = c1 + dc[k];
            if ( nr1 < 0 || nr1 >= h ) nr1 = r1, nc1 = c1;
            if ( nc1 < 0 || nc1 >= w ) nr1 = r1, nc1 = c1;
            if ( M[nr1][nc1] == '#' ) continue;
            if ( V[nr1][nc1][nr2][nc2][ncost%n] ) continue;
            V[nr1][nc1][nr2][nc2][ncost%n] = true;
            NODE next_node( ncost, PPP( PII( nr1, nc1 ), PII( nr2, nc2 ) ) );
            Q.push( next_node );
        }
    }

    cout << "impossible" << endl;
}

int main() {
    int h, w;
    while ( cin >> h >> w && h && w ) {
        solve( w, h );
    }
    return 0;
}