#include<bits/stdc++.h>
#define il inline
#define ui unsigned int
#define ll long long
#define ull unsigned ll
#define lll __int128
#define db double
#define ldb long double
#define pii pair<int,int>
#define vi vector<int>
#define vpii vector<pii>
#define fir first
#define sec second
#define gc getchar
#define pc putchar
#define mst(a,x) memset(a,x,sizeof a)
#define mcp(a,b) memcpy(a,b,sizeof b)
#define pb push_back
#define lb lower_bound
#define ub upper_bound
#define pct __builtin_popcount
using namespace std;
const int N=19,M=27,INF=0x3f3f3f3f,MOD=1e9+7;
const ll INFll=0x3f3f3f3f3f3f3f3f;
il int rd() {int x=0,f=1; char ch=gc(); while(ch<'0'||ch>'9') {if(ch=='-') f=-1; ch=gc();} while(ch>='0'&&ch<='9') x=x*10+ch-'0',ch=gc(); return x*f;}
il ll rdll() {ll x=0; int f=1; char ch=gc(); while(ch<'0'||ch>'9') {if(ch=='-') f=-1; ch=gc();} while(ch>='0'&&ch<='9') x=x*10+ch-'0',ch=gc(); return x*f;}
il void wr(int x) {if(x==INT_MIN) return printf("-2147483648"),void(); if(x<0) return pc('-'),wr(-x); if(x<10) return pc(x+'0'),void(); wr(x/10),pc(x%10+'0');}
il void wrll(ll x) {if(x==LLONG_MIN) return printf("-9223372036854775808"),void(); if(x<0) return pc('-'),wrll(-x); if(x<10) return pc(x+'0'),void(); wrll(x/10),pc(x%10+'0');}
il void wr(int x,char *s) {wr(x),printf("%s",s);}
il void wrll(ll x,char *s) {wrll(x),printf("%s",s);}
il int vmod(int x) {return x>=MOD?x-MOD:x;}
il int vadd(int x,int y) {return vmod(x+y);}
il int vsub(int x,int y) {return vmod(x-y+MOD);}
il int vmul(int x,int y) {return 1ll*x*y%MOD;}
il int qpow(int x,int y) {int res=1; for(;y;y>>=1,x=vmul(x,x)) if(y&1) res=vmul(res,x); return res;}
il void cadd(int &x,int y) {x=vmod(x+y);}
il void csub(int &x,int y) {x=vmod(x-y+MOD);}
il void cmul(int &x,int y) {x=vmul(x,y);}
il void cmax(int &x,int y) {x<y&&(x=y);}
il void cmaxll(ll &x,ll y) {x<y&&(x=y);}
il void cmin(int &x,int y) {x>y&&(x=y);}
il void cminll(ll &x,ll y) {x>y&&(x=y);}
int n,m,k,q[N+1],p[M],b[M],c[M],l[M],r[M],v[M],w[N+1][M],d[N][M],f[1<<N];
void QwQ() {
	n=rd(),m=rd(),mst(p,-1),f[0]=1;
	#define no(p) (p)&&(exit(puts("0")&0),0)
	#define chk(a,b) (!~a||a==b)
	for(int i=1;i<=n;i++) {
		string s,t; cin>>s>>t,mst(b,0),mst(c,0);
		for(int j=0;j<m;j++)
			if(t[j]=='O') no(!chk(p[j],s[j]-'A')),p[j]=s[j]-'A',c[s[j]-'A']++;
			else if(t[j]=='-') no(b[s[j]-'A']),d[j][s[j]-'A']=1,c[s[j]-'A']++;
			else b[s[j]-'A']=d[j][s[j]-'A']=1;
		for(int j=0;j<26;j++)
			if(b[j]) no(c[j]<l[j]||r[j]&&c[j]!=l[j]),l[j]=c[j],r[j]=1;
			else cmax(l[j],c[j]);
	}
	for(int i=0,x;i<26;i++) {
		no(~p[i]&&d[i][p[i]]),x=0;
		for(int j=0;j<m;j++) x+=p[j]==i;
		no(r[i]&&x>l[i]),cmax(l[i],x);
		for(int j=l[i];j--;) v[k++]=i;
	}
	no(k>m); for(;k<m;) v[k++]=26;
	for(int y=0;y<=m;y++) for(int i=0;i<26;i++) !r[i]&&!d[y][i]&&(w[y][++q[y]]=i);
	for(int s=0,x,y;s<1<<m;s++) if(f[s]) {
		mst(c,0),x=0,y=pct(s);
		for(int i=0;i<m;i++) c[v[i]]+=!(s>>i&1)&&v[i]!=26;
		for(int i=y+1;i<m;i++) ~p[i]&&c[p[i]]--;
		for(int i=1;i<=q[y];i++) x+=!c[w[y][i]];
		for(int i=0,g;i<m;i++) !(s>>i&1)&&(!i||v[i]!=v[i-1]||(s>>i-1&1))&&(
			g=v[i]==26?x*(!~p[y]):!d[y][v[i]]&&chk(p[y],v[i]),
			g&&(cadd(f[s|1<<i],vmul(f[s],g)),0));
	}
	wr(f[(1<<m)-1],"\n");
}
signed main() {
//	freopen("in.in","r",stdin),freopen("out.out","w",stdout);
	int T=1; while(T--) QwQ();
}