#include<bits/stdc++.h>

using namespace std;

const int mod=;

int n,m,sx,sy,t;

long long much;

char ju[][];

int vis[][];

int dis[][];

int dx[]={-,,,};

int dy[]={,-,,};

struct node

{

    int x,y;

};

queue<node>q;

int main()

{

    scanf("%d%d\n",&n,&m);

    memset(vis,-,sizeof(vis));

    memset(dis,,sizeof(dis));

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

      for(int j=;j<=m;j++)

      {

          cin>>ju[i][j];  //我的锅就在这里QWQ 

          if(ju[i][j]=='*')

          {

              sx=i;sy=j;

            vis[i][j]=;

        }

        if(ju[i][j]=='o')

          vis[i][j]=;

        if(ju[i][j]=='#')

          vis[i][j]=;

      }

    node h;

    h.x =sx;h.y =sy;

    q.push(h);

    while(!q.empty())

    {

        node now=q.front();

        q.pop();

        t=max(t,dis[now.x][now.y]);

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

        {

            int xx=now.x +dx[i];

            int yy=now.y +dy[i];

            if(vis[xx][yy]==)

            {

                dis[xx][yy]=dis[now.x ][now.y ]+;

                vis[xx][yy]=;

                node h;

                h.x =xx;

                h.y =yy;

                q.push(h);

            }

        }

    }

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

        for(int j=;j<=m;j++)

        {

            if(dis[i][j]!=)

            {

                dis[i][j]=t-dis[i][j]+;

            much=(much%mod+dis[i][j]%mod)%mod;

          }

        }

    printf("%d\n",t);

    printf("%ld\n",much);

    return ;

}