#include "cstdio"

#include "string"

#include "cstring"

#include "iostream"

#include "vector"

#include "queue"

using namespace std;

#define inf 1<<28

struct status

{

    int x,y,dep;

    status(int x,int y,int dep):x(x),y(y),dep(dep) {}

    bool operator < (const status &a) const

    {

        return dep>a.dep;

    }

};

int n,m,map[][],vis[][],dir[][]={-,,,,,-,,},ans;

void bfs(int x,int y)

{

    priority_queue<status> Q;

    Q.push(status(x,y,));

    vis[x][y]=true;

    bool flag=false;

    while(!Q.empty())

    {

        if(flag) break;

        status t=Q.top();Q.pop();

        for(int s=;s<;s++)

        {

            int X=t.x+dir[s][],Y=t.y+dir[s][];

            if(vis[X][Y]||X<||X>n||Y<||Y>n||!map[X][Y]) continue;

            vis[X][Y]=true;

            if(map[X][Y]==) {flag=true;ans=min(ans,t.dep+);};

            if(map[X][Y]==) Q.push(status(X,Y,t.dep+));

            else Q.push(status(X,Y,t.dep+));

        }

    }

}

int main()

{

    //freopen("in.txt","r",stdin);

    ios::sync_with_stdio(false);

    string tt;

    while(cin>>n>>m&&n)

    {

        vector<status> f;

        ans=inf;

        for(int i=;i<=n;i++)

        {

            cin>>tt;

            for(int j=;j<tt.size();j++)

            {

                if(tt[j]=='#') map[i][j+]=;

                if(tt[j]=='.') map[i][j+]=;

                if(tt[j]=='a') map[i][j+]=;

                if(tt[j]=='x') map[i][j+]=;

                if(tt[j]=='r') {map[i][j+]=;f.push_back(status(i,j+,));}

            }

        }

        for(int i=;i<f.size();i++)

        {

            memset(vis,,sizeof(vis));

            bfs(f[i].x,f[i].y);

        }

        if(ans!=inf) cout<<ans<<endl;

        else cout<<"Poor ANGEL has to stay in the prison all his life."<<endl;

    }

}