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 <string>
#include <queue>
#include <set>
using namespace std;

class Node{
public:
  int ax;
  int ay;
  int bx;
  int by;
  int p;

  int cost;
  Node(int ax, int ay, int bx, int by, int p, int cost)
    : ax(ax), ay(ay), bx(bx), by(by), p(p), cost(cost) { }
  bool operator <(const Node &N) const{
    if(ax != N.ax) return ax < N.ax;
    if(ay != N.ay) return ay < N.ay;
    if(bx != N.bx) return bx < N.bx;
    if(by != N.by) return by < N.by;
    if(p != N.p) return p < N.p;
    return false;
  }
};

int main() {
  while(1) {
    int H, W;
    cin >> H >> W;
    if(H == 0 && W == 0) break;
    char data[H][W];
    Node N(0,0,0,0,0,0);
    for(int i = 0; i < H; i++) {
      for(int j = 0; j < W; j++) {
	cin >> data[i][j];
	if(data[i][j] == 'A') {
	  N.ax = j;
	  N.ay = i;
	  data[i][j] = '.';
	}
	if(data[i][j] == 'B') {
	  N.bx = j;
	  N.by = i;
	  data[i][j] = '.';
	}
      }
    }

    string pat;
    cin >> pat;

    queue<Node> Q;
    Q.push(N);
    set<Node> visited;
    visited.insert(N);
    int d[5][2] = {{0,0},{0,-1},{1,0},{-1,0},{0,1}};

    int ansX, ansY, ansCost;
    ansX = ansY = ansCost = -1;

    while(!Q.empty()) {
      N = Q.front();
      Q.pop();

      if(N.ax == N.bx && N.ay == N.by) {
	ansX = N.ax;
	ansY = N.ay;
	ansCost = N.cost;
	break;
      }

      Node newN(0,0,0,0, (N.p+1)%pat.length(), N.cost + 1);

      int bd = -1;

      switch(pat[N.p]) {
      case '5':bd = 0; break;
      case '8':bd = 1; break;
      case '6':bd = 2; break;
      case '4':bd = 3; break;
      case '2':bd = 4; break;
      }

      newN.bx = N.bx + d[bd][0];
      newN.by = N.by + d[bd][1];
      if(newN.bx < 0 || newN.bx >= W) newN.bx = N.bx;
      if(newN.by < 0 || newN.by >= H) newN.by = N.by;

      for(int i = 0; i < 5; i++) {
	newN.ax = N.ax + d[i][0];
	newN.ay = N.ay + d[i][1];
	if(newN.ax < 0 || newN.ax >= W) newN.ax = N.ax;
	if(newN.ay < 0 || newN.ay >= H) newN.ay = N.ay;
	if(data[newN.ay][newN.ax] == '#') {
	  newN.ax = N.ax;
	  newN.ay = N.ay;
	}
	if(visited.find(newN) != visited.end()) continue;
	visited.insert(newN);
	Q.push(newN);
      }
    }
    if(ansX != -1 && ansY != -1 && ansCost != -1) {
      cout << ansCost << " " << ansY << " " << ansX << endl;
    } else {
      cout << "impossible" << endl;
    }
  }
  return 0;
}

C++: #include <iostream>
#include <cstdio>
#include <vector>
#include <algorithm>
#include <complex>
#include <cstring>
#include <cstdlib>
#include <string>
#include <cmath>
#include <queue>
using namespace std;

#define REP(i,n) for(int i=0;i<(int)n;++i)
#define FOR(i,c) for(__typeof((c).begin())i=(c).begin();i!=(c).end();++i)
#define ALL(c) (c).begin(), (c).end()
const int INF = 1<<29;

int main() {
  int h,w;
  while(cin >> h>>w,h||w) {
    char ba[h][w];
    int ax,ay, bx,by;
    REP(i,h) {
      REP(j,w) {
        cin >> ba[i][j];
        if (ba[i][j]=='A') {
          ax = j;
          ay = i;
        }else if (ba[i][j]=='B') {
          bx = j;
          by = i;
        }
      }
    }
    const int dx[] = {0,-1,1,0};
    const int dy[] = {1,0,0,-1};

    int dis[h][w];
    REP(i,h) REP(j,w) dis[i][j] = INF;
    typedef pair<int,int> pii;
    queue<pair<int,pii> > Q;
    Q.push(make_pair(0, pii(ax,ay)));
    int maxd = 0;
    while(!Q.empty()) {
      int x = Q.front().second.first;
      int y = Q.front().second.second;
      int d = Q.front().first;
      Q.pop();

      dis[y][x] = d;
      maxd = max(maxd,d);
      REP(k,4) {
        int xx = x+dx[k];
        int yy = y+dy[k];

        if (xx<0||xx>=w||yy<0||yy>=h) continue;
        if (ba[yy][xx]=='#') continue;
        if (dis[yy][xx] != INF) continue;
        
        Q.push(make_pair(d+1, pii(xx,yy)));
      }
    }
    // REP(y,h) {
    //   REP(x,w) {
    //     if (dis[y][x] == INF) cout << -1 << " ";
    //     else
    //       printf("%2d ", dis[y][x]);
    //   }
    //   cout << endl;
    // }
    string s;
    cin >> s;
    int m = s.size();
    int memo[h][w][m];
    memset(memo,0,sizeof(memo));

    int cnt = 0;
    int res = INF;
    int ansx,ansy;
    while(1) {
//      printf("(%d,%d) ",bx,by);
      if (dis[by][bx] <= cnt) {
        if(cnt<res) {
          res = cnt;
          ansx = bx;
          ansy = by;
        }
      }

      if (cnt >= maxd) {
        if (memo[by][bx][cnt%m]) {
          break;
        }
        memo[by][bx][cnt%m] = 1;
      }


      if (s[cnt%m]-'0' != 5) {
        int dir = (s[cnt%m]-'0')/2-1;
        bx += dx[dir];
        by += dy[dir];
        if (bx<0||bx>=w||by<0||by>=h) {
          bx -= dx[dir];
          by -= dy[dir];
        }
      }
      
      cnt++;
    }

    if (res == INF) {
      cout << "Impossible" << endl;
    } else
      printf("%d %d %d\n", res, ansy, ansx);
  }
}