#include<cstdio>
#include<cmath>
#include<cstring>
#include<algorithm>
using namespace std;
int a[1005][1005],c[1005][1005],n,m,k=0,dx[5]={0,1,-1,0,0},dy[5]={0,0,0,1,-1},f[1000050],ans=0,sum=0;
bool vis[1005][1005];void dfs(int x,int y,int time)
{if (c[x][y]<=time) return;else c[x][y]=time;for (int i=1;i<=4;i++){if (vis[x+dx[i]][y+dy[i]]==true) continue;if (a[x+dx[i]][y+dy[i]]==-1) continue;if (a[x][y]==100) vis[x][y]=true,dfs(x+dx[i],y+dy[i],time+2),vis[x][y]=false;else{if (a[x+dx[i]][y+dy[i]]==100) vis[x][y]=true,dfs(x+dx[i],y+dy[i],time+2),vis[x][y]=false;else{if (a[x][y]==99) vis[x][y]=true,dfs(x+dx[i],y+dy[i],time+2),vis[x][y]=false;else{if (abs(a[x+dx[i]][y+dy[i]]-a[x][y])<=1){if (abs(a[x+dx[i]][y+dy[i]]-a[x][y])==1) vis[x][y]=true,dfs(x+dx[i],y+dy[i],time+3),vis[x][y]=false;else vis[x][y]=true,dfs(x+dx[i],y+dy[i],time+1),vis[x][y]=false;}}}}}
}
void df(int x,int z)
{ans=min(ans,max(z+f[k-1],sum-z+f[k]));ans=min(ans,max(z+f[k],sum-z+f[k-1]));for (int i=x+1;i<=k-2;i++)df(i,z+f[i]);
}
int main()
{scanf("%d %d\n",&n,&m);memset(a,-1,sizeof(a));int x1,y1;for (int i=1;i<=n;i++){char ch;for (int j=1;j<=m;j++){scanf(" %c",&ch);if (ch>='0'&&ch<='9') a[i][j]=ch-'0';if (ch=='$') a[i][j]=100;if (ch=='X') a[i][j]=99,x1=i,y1=j;}ch=getchar();}memset(c,127,sizeof(c));memset(vis,false,sizeof(vis));dfs(x1,y1,0);for (int i=1;i<=n;i++)for (int j=1;j<=m;j++)if (a[i][j]==100){if (c[i][j]==2139062143){printf("-1\n");return 0;}f[++k]=c[i][j];}sort(f+1,f+1+k);if (k==1) printf("%d\n",f[1]);else if (k==2) printf("%d\n",f[1]+f[2]);else{sum=0;for (int i=1;i<=k-2;i++)f[i]=f[i]*2,sum+=f[i];ans=2147483647;df(0,0);printf("%d\n",ans);}
}