#include<iostream>
#include<cmath>
#include<cstdio>
#include<algorithm>
#include<queue>
using namespace std;
char map[101][101];
int step=9999999;
int yaox[10010],yaoy[10010],book[101][101],n,m;
int road(int a,int b,int x,int y)
{
    return abs(x-a)+abs(y-b);//A* 横竖的大概路径，方便减少路径数，优化时间
}
int bfs(int a,int b,int x,int y)
{
    memset(book,0,sizeof(book));
    int nx,ny;
    queue <int> Qx;//存横竖坐标
    queue <int> Qy;
    Qx.push(a);//当前点坐标进队
    Qy.push(b);
    while(!Qx.empty())//队不为空
    {
        nx=Qx.front(),ny=Qy.front();//队首元素
        if(nx==x&&ny==y)//到达终点
        {
            return book[nx][ny];
        }
        Qx.pop();
        Qy.pop();
        if(book[nx-1][ny]==0 && map[nx-1][ny]!=‘#‘ && nx>0)//判断是否走过，是否能走，是否出界
        {
            Qx.push(nx-1);
            Qy.push(ny);
            book[nx-1][ny]=book[nx][ny]+1;//步数加一
        }
        if(book[nx+1][ny]==0 && map[nx+1][ny]!=‘#‘ && nx<=n)
        {
            Qx.push(nx+1);
            Qy.push(ny);
            book[nx+1][ny]=book[nx][ny]+1;
        }
        if(book[nx][ny-1]==0 && map[nx][ny-1]!=‘#‘ && ny>0)
        {
            Qx.push(nx);
            Qy.push(ny-1);
            book[nx][ny-1]=book[nx][ny]+1;
        }
        if(book[nx][ny+1]==0 && map[nx][ny+1]!=‘#‘ && ny<=m)
        {
            Qx.push(nx);
            Qy.push(ny+1);;
            book[nx][ny+1]=book[nx][ny]+1;
        }
    }
    return 0;
}
int main()
{
    while(cin>>n>>m)
    {
        int i,j,k=1,x,y,s1,s2;
        if(n==0&&m==0)
        {
            break;
        }

        for(i=1;i<=n;i++)
        {
            for(j=1;j<=m;j++)
            {
                cin>>map[i][j];
                if(map[i][j]==‘@‘)//李逍遥坐标
                {
                    x=i;
                    y=j;
                }
                if(map[i][j]==‘s‘)//婶婶坐标
                {
                    s1=i;
                    s2=j;
                }
            }
        }
        int minans=99999999;
        for(i=1;i<=n;i++)
        {
            for(j=1;j<=m;j++)
            {
                if(map[i][j]==‘*‘)//有药
                {
                    int yao;
                    yao=road(i,j,x,y);
                    yao+=road(i,j,s1,s2);
                    if(yao<minans)
                    {
                        int s=0;
                        s+=bfs(x,y,i,j);
                        s+=bfs(i,j,s1,s2);
                        if(s<minans)
                            minans=s;//更新最大值
                    }
                }
            }
        }
        cout<<minans<<endl;
    }
    //system("puase");
    return 0;
}