// includes
#include <bits/stdc++.h>

// macros
#define ll long long int
#define pb emplace_back
#define mk make_pair
#define pq priority_queue
#define FOR(i, a, b) for(int i=(a);i<(b);++i)
#define rep(i, n) FOR(i, 0, n)
#define rrep(i, n) for(int i=((int)(n)-1);i>=0;i--)
#define irep(itr, st) for(auto itr = (st).begin(); itr != (st).end(); ++itr)
#define irrep(itr, st) for(auto itr = (st).rbegin(); itr != (st).rend(); ++itr)
#define vrep(v, i) for(int i = 0; i < (v).size(); i++)
#define all(x) (x).begin(),(x).end()
#define sz(x) ((int)(x).size())
#define UNIQUE(v) v.erase(unique(v.begin(), v.end()), v.end())
#define FI first
#define SE second
#define dump(a, n) for(int i = 0; i < n; i++)cout << a[i] << "\n "[i + 1 != n];
#define dump2(a, n, m) for(int i = 0; i < n; i++)for(int j = 0; j < m; j++)cout << a[i][j] << "\n "[j + 1 != m];
#define bit(n) (1LL<<(n))
#define INT(n) int n; cin >> n;
#define LL(n) ll n; cin >> n;
#define DOUBLE(n) double n; cin >> n;
using namespace std;

//  types
typedef pair<int, int> P;
typedef pair<ll, int> Pl;
typedef pair<ll, ll> Pll;
typedef pair<double, double> Pd;
typedef complex<double> cd;
 
// constants
const int inf = 1e9;
const ll linf = 1LL << 50;
const double EPS = 1e-10;
const int mod = 1e9 + 7;
const int dx[5] = {-1, 0, 1, 0, 0};
const int dy[5] = {0, -1, 0, 1, 0};

// solve
template <class T>bool chmax(T &a, const T &b){if(a < b){a = b; return 1;} return 0;}
template <class T>bool chmin(T &a, const T &b){if(a > b){a = b; return 1;} return 0;}
template <typename T> istream &operator>>(istream &is, vector<T> &vec){for(auto &v: vec)is >> v; return is;}
template <typename T> ostream &operator<<(ostream &os, const vector<T>& vec){for(int i = 0; i < vec.size(); i++){ os << vec[i]; if(i + 1 != vec.size())os << " ";} return os;}
template <typename T> ostream &operator<<(ostream &os, const set<T>& st){for(auto itr = st.begin(); itr != st.end(); ++itr){ os << *itr; auto titr = itr; if(++titr != st.end())os << " ";} return os;}
template <typename T> ostream &operator<<(ostream &os, const unordered_set<T>& st){for(auto itr = st.begin(); itr != st.end(); ++itr){ os << *itr; auto titr = itr; if(++titr != st.end())os << " ";} return os;}
template <typename T> ostream &operator<<(ostream &os, const multiset<T>& st){for(auto itr = st.begin(); itr != st.end(); ++itr){ os << *itr; auto titr = itr; if(++titr != st.end())os << " ";} return os;}
template <typename T> ostream &operator<<(ostream &os, const unordered_multiset<T>& st){for(auto itr = st.begin(); itr != st.end(); ++itr){ os << *itr; auto titr = itr; if(++titr != st.end())os << " ";} return os;}
template <typename T1, typename T2> ostream &operator<<(ostream &os, const pair<T1, T2> &p){os << p.first << " " << p.second; return os;}
template <typename T1, typename T2> ostream &operator<<(ostream &os, const map<T1, T2> &mp){for(auto itr = mp.begin(); itr != mp.end(); ++itr){ os << itr->first << ":" << itr->second; auto titr = itr; if(++titr != mp.end())os << " "; } return os;}
template <typename T1, typename T2> ostream &operator<<(ostream &os, const unordered_map<T1, T2> &mp){for(auto itr = mp.begin(); itr != mp.end(); ++itr){ os << itr->first << ":" << itr->second; auto titr = itr; if(++titr != mp.end())os << " "; } return os;}

string s[21];
int dis[21][21];

int main(int argc, char const* argv[])
{
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout << fixed << setprecision(20);
  while(true){
  	INT(h); INT(w); if(h == 0 && w == 0)break;
  	rep(i, h)cin >> s[i];
  	string u; cin >> u;
  	vector<int> v(sz(u));
  	rep(i, sz(u)){
  		if(u[i] == '5')v[i] = 4;
  		else if(u[i] == '8')v[i] = 0;
  		else if(u[i] == '6')v[i] = 3;
  		else if(u[i] == '4')v[i] = 1;
  		else if(u[i] == '2')v[i] = 2;
  	}
	rep(i, h)rep(j, w)dis[i][j] = inf;
	int sx, sy; rep(i, h)rep(j, w)if(s[i][j] == 'A')sx = i, sy = j;
	queue<P> q; q.push(mk(sx, sy)); dis[sx][sy] = 0;
	while(!q.empty()){
		auto p = q.front(); q.pop();
		rep(k, 4){
			int nx = p.FI + dx[k];
			int ny = p.SE + dy[k];
			if(0 <= nx && nx < h && 0 <= ny && ny < w && s[nx][ny] != '#'){
				if(dis[nx][ny] > dis[p.FI][p.SE] + 1){
					dis[nx][ny] = dis[p.FI][p.SE] + 1;
					q.push(mk(nx, ny));
				}
			}
		}
	}
	//rep(i, h)rep(j, w)cout << dis[i][j] << "\n "[j + 1 != w];
	int bx, by; rep(i, h)rep(j, w)if(s[i][j] == 'B')bx = i, by = j;
	for(int i = 0; i < 10000; i++){
		if(i >= dis[bx][by]){
			cout << i << " " << bx << " " << by << endl;
			break;
		}
		bx += dx[v[i%sz(v)]];
		by += dy[v[i%sz(v)]];
		if(bx < 0)bx = 0; if(bx >= h)bx = h - 1;
		if(by < 0)by = 0; if(by >= w)by = w - 1;
		if(i + 1 == 10000){
			cout << "impossible" << endl;
		}
	}
  }
  return 0;
}


Measured memory_bytes: 3220