#include <stdio.h>
#include <iostream>
#include <queue>
using namespace std;

int n, m, mark, minx;
int visited[105][105];
int dir[4][2] = {0, -1, 1, 0, 0, 1, -1, 0};
int Footx[10005], Footy[10005];    //作为转换的路径数组
char map[105][105];

struct foot    //存储路径的结构体
{
    int x, y;
}Foot[105][105];

struct node         //优先队列结构体，耗时少的优先
{
    int x, y;
    int time;

    friend bool operator < (node a, node b)
    {
        return a.time > b.time;
    }
};

int Judge(int x, int y)     //判断这个点是否符合
{
    if(x<0 || x>=n || y<0 || y>=m)
        return 1;
    if(map[x][y] == ‘X‘ || visited[x][y])
        return 1;

    return 0;
}

void BFS(int startx, int starty, int time)     //BFS搜索最短路
{
    priority_queue <node> Q;
    struct node Node, temp;
    Node.x = startx;      Node.y = starty;
    Node.time = 0;
    visited[startx][starty] = 1;
    Q.push(Node);

    while(!Q.empty())
    {
        Node = Q.top();
        Q.pop();

        if(Node.x == n-1 && Node.y == m-1)
        {
            minx = Node.time;
            mark = 1;
            return;
        }

        for(int i = 0; i<4; i++)
        {
            temp.x = Node.x+dir[i][0];
            temp.y = Node.y+dir[i][1];
            temp.time = Node.time+1;

            if(Judge(temp.x, temp.y))
                continue;
            if(map[temp.x][temp.y] == ‘.‘)
            {
                Foot[temp.x][temp.y].x = Node.x;     //将上一个节点存储下来
                Foot[temp.x][temp.y].y = Node.y;
                visited[temp.x][temp.y] = 1;
                Q.push(temp);
            }
            if(map[temp.x][temp.y]>=‘1‘ && map[temp.x][temp.y]<=‘9‘)
            {
                Foot[temp.x][temp.y].x = Node.x;
                Foot[temp.x][temp.y].y = Node.y;
                temp.time = temp.time+map[temp.x][temp.y]-‘1‘+1;
                visited[temp.x][temp.y] = 1;
                Q.push(temp);
            }
        }

    }
}

void Show()
{
    printf("It takes %d seconds to reach the target position, let me show you the way.\n", minx);
    int k = 0, i =minx, num;
    Footx[k] = n-1;    Footy[k] = m-1;
    while(i--)       //将存储下来的路径转换出来，我们就可以知道走过了那些点
    {
        if(Footx[k] == 0 && Footy[k] == 0)
            break;
        k++;
        Footx[k] = Foot[ Footx[k-1] ][ Footy[k-1] ].x;
        Footy[k] = Foot[ Footx[k-1] ][ Footy[k-1] ].y;
    }
    num = 1;
    for(int j = k-1; j>=0; j--)    //根据走过的这些点来进行输出
    {
        if(map[ Footx[j] ][ Footy[j] ] == ‘.‘)
            printf("%ds:(%d,%d)->(%d,%d)\n", num++, Footx[j+1], Footy[j+1], Footx[j], Footy[j]);
        if(map[ Footx[j] ][ Footy[j] ]>=‘1‘ && map[ Footx[j] ][ Footy[j] ]<=‘9‘)
        {
            printf("%ds:(%d,%d)->(%d,%d)\n", num++, Footx[j+1], Footy[j+1], Footx[j], Footy[j]);
            for(int t = 1; t<=map[ Footx[j] ][ Footy[j] ]-‘0‘; t++)
            {
                printf("%ds:FIGHT AT (%d,%d)\n", num++, Footx[j], Footy[j]);
            }
        }
    }

}

int main()
{
    while(scanf("%d%d", &n, &m)!=EOF)
    {
        for(int i = 0; i<n; i++)
        {
            for(int j = 0; j<m; j++)
            {
                cin>>map[i][j];
                visited[i][j] = 0;
            }
        }
        mark = 0;
        BFS(0, 0, 0);

        if(mark)
            Show();
        else
            printf("God please help our poor hero.\n");
        printf("FINISH\n");
    }
    return 0;
}