#include<bits/stdc++.h>

 using namespace std;

 typedef long long ll;

 ll read(){

     ll x=,f=;char c=getchar();

     while(c<'' || c>''){if(c=='-')f=-;c=getchar();}

     while(c>='' && c<=''){x=x*+c-'';c=getchar();}

     return x*f;

 }

 char get(){

     char c=getchar();

     while(c!='.' && c!='*') c=getchar();

     return c;

 }

 const int mod=1e9+;

 int n,m;

 char s[][];

 int f[][][][],g[][][][];

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

 inline void pl(int &a,int b){a=a+b;if(a>mod) a-=mod;}

 inline void dec(int &a,int b){a=a-b;if(a<) a+=mod;}

 int q,w,e,r;

 int dp(int a,int b,int c,int d){

     //cout<<a<<' '<<b<<' '<<c<<' '<<d<<endl;

     if(s[a][b]!=s[c][d]) return ;

     if(a< || a>n || b< || b>m || c< || c>n || d< || d>m) return ;

     if(f[a][b][c][d]) return f[a][b][c][d];

     int sum=;

     for(int d1=;d1<;d1++){

         if(dx[q][w][d1]== && dy[q][w][d1]==) continue;

         int nwa=a+dx[q][w][d1],nwb=b+dy[q][w][d1];

         for(int d2=;d2<;d2++){

             if(dx[e][r][d2]== && dy[e][r][d2]==) continue;

             int nwc=c+dx[e][r][d2],nwd=d+dy[e][r][d2];

             pl(sum,dp(nwa,nwb,nwc,nwd));

         }

     }

     return f[a][b][c][d]=sum;

 }

 int solve(int a,int b,int c,int d){

     if(g[a+][b+][c+][d+]!=) return g[a+][b+][c+][d+];

     memset(f,,sizeof(f));

 //  cout<<a<<' '<<b<<' '<<c<<' '<<d<<endl;

     q=a+,w=b+,e=c+,r=d+;

     int ret=;

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

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

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

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

                     pl(ret,dp(i,j,x,y));

     g[a+][b+][c+][d+]=g[c+][d+][a+][b+]=g[-a][-b][-c][-d]=g[-c][-d][-a][-b]=ret;

     return ret;

 }

 int solve(int a,int b){

     int ans=;

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

         for(int j=-;j<=;j++){

             if(i== && j==) continue;

             if(i== || j==) dec(ans,solve(a,b,i,j));

             else pl(ans,solve(a,b,i,j));

         }

     return ans;

 }

 int main(){

     #ifdef LZT

     freopen("in","r",stdin);

     freopen("out2","w",stdout);

     #endif

     n=read(),m=read();

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

         scanf("%s",s[i]+);

     int ans=;

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

         for(int j=-;j<=;j++){

             if(i== && j==) continue;

             if(i== || j==) dec(ans,solve(i,j));

             else pl(ans,solve(i,j));

         }

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

     return ;

 }