#include <iostream>
#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <cmath>
#include <vector>
#include <string>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <algorithm>

using namespace std;

#define rep(i,j) REP((i), 0, (j))
#define REP(i,j,k) for(int i=(j);(i)<(k);++i)
#define BW(a,x,b) ((a)<=(x)&&(x)<=(b))
#define MP make_pair
#define PB push_back
#define F first
#define S second
#define AY second.first.first
#define AX second.first.second
#define BY second.second.first
#define BX second.second.second
#define INF 1 << 30
#define EPS 1e-10

typedef pair<int, int> P;
typedef pair<int, P> pii;
typedef pair<P, P>pipi;
typedef vector<int> vi;
typedef queue<int> qi;
typedef long long ll;

int dy[] = {0, -1,0,1,0}, dx[] = {0, 0,-1,0,1};
int gdy[] = {0, 0, 1, 0, 0, 0, 0, 0, -1}, gdx[] = {0, 0, 0, 0, -1, 0, 1, 0, 0};
int H, W;
char field[32][32], pattern[16];

P nexta(int y, int x, int d){
  int ny = y+dy[d], nx = x+dx[d];
  ny = max(0, min(H-1, ny));
  nx = max(0, min(W-1, nx));
  if(field[ny][nx] == '#'){
    ny = y;
    nx = x;
  }
  return MP(ny, nx);
}

P nextb(int y, int x, int c){
  int L = strlen(pattern);
  int ny = y+gdy[pattern[c%L]-'0'], nx = x+gdx[pattern[c%L]-'0'];
  ny = max(0, min(H-1, ny));
  nx = max(0, min(W-1, nx));
  return MP(ny, nx);
}

int main(){
  while(scanf("%d%d", &H, &W) && H+W){
    rep(i, H) scanf("%s", field[i]);
    scanf("%s", pattern);
    int ay, ax, by, bx;
    rep(i, H) rep(j, W){
      if(field[i][j] == 'A'){ ay = i; ax = j;}
      else if(field[i][j] == 'B'){ by = i; bx = j;}
    }

    queue<pair<int, pipi> >q;
    map<pair<pipi, int>, int>m;
    q.push(MP(0, MP(MP(ay, ax), MP( by, bx))));
    m[MP(MP(MP(ay, ax), MP(by, bx)), -1)] = 1;

    while(!q.empty()){
      pair<int, pipi> now = q.front(); q.pop();
      if(now.AY == now.BY && now.AX == now.BX){
	printf("%d %d %d\n", now.F, now.AY, now.AX);
	goto e;
      }
      //      printf("%d %d %d %d %d\n", now.F, now.AY, now.AX, now.BY, now.BX);
      rep(d, 5){
	P na = nexta(now.AY, now.AX, d);
	P nb = nextb(now.BY, now.BX, now.F);
	//	int any = now.AY+dy[d], anx = now.AX+dx[d];
	//	int bny = now.BY+gdy[pattern[(now.F%strlen(pattern))]-'0'], bnx = now.BX+gdx[pattern[(now.F%strlen(pattern))]-'0'];
	//	printf("%d %d %d %d\n", any, anx, bny, bnx);
	//	if(any < 0 || any >= H || anx < 0 || anx >= W || bny < 0 || bny >= H || bnx < 0 || bnx >= W ||
	//	   field[any][anx] == '#' || m.count(MP(MP(any, anx), MP(bny, bnx)))) continue;
	if(m.count(MP(MP(na, nb), (now.F%strlen(pattern))))) continue;

	m[MP(MP(na, nb), now.F%strlen(pattern))] = 1;
	q.push(MP(now.F+1, MP(na, nb)));
      }
    }
    puts("impossible");
  e:;
  }
  return 0;
}