#include<bits/stdc++.h>
#define Gc() getchar() 
#define Me(x,y) memset(x,y,sizeof(x))
#define Mc(x,y) memcpy(x,y,sizeof(x))
#define d(x,y) ((m)*(x-1)+(y))
#define R(n) (rnd()%(n)+1)
#define Pc(x) putchar(x)
#define LB lower_bound
#define UB upper_bound
#define fi first
#define se second
using namespace std;using ll=long long;using db=double;using lb=long db;using ui=unsigned;using ull=unsigned long long;using pii=pair<int,int>;using LL=__int128;
const int N=50+5,M=(1<<16)+5,K=(1<<25)+5,mod=1e9+7,Mod=mod-1;const db eps=1e-9;const int INF=1e9+7;mt19937 rnd(time(0));
int n,m,vis[N][N][N][10];char s[N];
struct node{
	ll x,w;
	node operator *(const node &B)const{return (node){x*B.x%mod,(w*B.x+B.w*x)%mod};}
	node operator +(const node &B)const{return (node){(x+B.x)%mod,(w+B.w)%mod};}
	node operator *(const ll &B)const{return (node){x,(w+B*x)%mod};}
}f[N][N][N],dp[N][11],Cl;
ll Po[N];
void Solve(){
	int i,j,h,k;scanf("%d%d",&n,&m);
	for(Po[0]=i=1;i<=m;i++) Po[i]=Po[i-1]*10%mod;
	Me(vis,0x3f);
	for(i=1;i<=n;i++) {
		scanf("%s",s+1);
		for(j=1;j<=m;j++) if(s[j]^'?') {
			s[j]-='0';
			for(h=1;h<=i;h++) for(k=i;k<=n;k++) for(int o=0;o<10;o++) if(s[j]^o) vis[j][h][k][o]=0;
		}
	}
	for(i=1;i<=n;i++) f[m+1][i][i]=(node){1,0};
	for(i=m;i;i--){
		for(j=0;j<=n;j++) f[i+1][j+1][j]=(node){1,0};
		for(j=1;j<=n;j++){
			fill(dp[j-1],dp[j-1]+11,Cl);
			for(int o=0;o<=10;o++) dp[j-1][o]=(node){1,0};
			for(h=j;h<=n;h++){
				fill(dp[h],dp[h]+11,Cl);
				for(int o=1;o<=10;o++){
					for(k=j-1;k<=h;k++) if(vis[i][k+1][h][o-1]) dp[h][o]=dp[h][o]+f[i+1][k+1][h]*(Po[m-i]*(o-1)*(h-k)%mod)*dp[k][o-1];
				}
				f[i][j][h]=dp[h][10];
			}
		}
	}
	printf("%lld\n",f[1][1][n].w);
}
int main(){
	int t=1;
	// scanf("%d",&t);
	while(t--) Solve();
	cerr<<clock()*1.0/CLOCKS_PER_SEC<<'\n';
}