#include<cstdio>
#include<cstring>
#include<queue>
#define max 102
using namespace std;
 
struct Node
{
    int x,y,time;
    friend bool operator < (Node a,Node b)//运用重载比较运算符定义算子 
    {
         return a.time>b.time;//将队列的时间从大到小排列，小的先出列 
    }
};

struct node//路径存储每一步的前一步 
{
    int x,y,time;
}path[max][max];

char map[max][max];
int n,m,dir[][2]={0,1,0,-1,1,0,-1,0};

bool judge(int x,int y)//前进一步的判断条件 
{
    return x>=0&&y>=0&&x<n&&y<m&&map[x][y]!='X';
}

bool bfs(int ×)
{
    Node p,next;
    p.x=p.y=p.time=0;
    next.time=0;
    priority_queue<Node> q;
    q.push(p);
    while(q.size())
    {
        p=q.top();
        q.pop();
        if(p.x==n-1&&p.y==m-1)
        {
            times=p.time; return true;
        }
        for(int i=0; i<4; i++)
        {
            next=p;//注意，很巧妙的处理，为下面++next.time做铺垫 
            next.x+=dir[i][0];
            next.y+=dir[i][1];
            if(!judge(next.x,next.y))   continue;
            ++next.time;//路径存储过程 
            path[next.x][next.y].x=p.x;
            path[next.x][next.y].y=p.y;
            path[next.x][next.y].time=0;
            if(map[next.x][next.y]!='.')
            {
                next.time+=map[next.x][next.y]-'0';
                path[next.x][next.y].time=map[next.x][next.y]-'0';
            }
            map[next.x][next.y]='X';//标记为已路过 
            q.push(next);
        }
    }
    return false;
}

void printPath(int times,int x,int y)//输出路径
{ 
    if(times==0) return;
    times-=path[x][y].time;
    printPath(times-1,path[x][y].x,path[x][y].y);
    printf("%ds:(%d,%d)->(%d,%d)\n",times++,path[x][y].x,path[x][y].y,x,y);
    while(path[x][y].time--)
    {
        printf("%ds:FIGHT AT (%d,%d)\n",times++,x,y);
    }
}
int main()
{
    while(scanf("%d %d",&n,&m)!=EOF)
    {
        for(int i=0; i<n; i++)
        {
            scanf("%s",map[i]);
        }
        memset(path,0,sizeof(path));
        int times=0;
        if(bfs(times))
        {
            printf("It takes %d seconds to reach the target position, let me show you the way.\n",times);
            printPath(times,n-1,m-1);
        }
        else
        {
            printf("God please help our poor hero.\n");
        }
        printf("FINISH\n");
    }
    return 0;
}