#include<iostream>
#include<cstdio>
#define N 494
#define M 19
#define K 26
#define mod 1000000007
using namespace std;
int read()
{
	char c=0;
	int sum=0;
	while (c<'0'||c>'9') c=getchar();
	while ('0'<=c&&c<='9') sum=sum*10+c-'0',c=getchar();
	return sum;
}
int fast_pow(int a,int b)
{
	int res=1,mul=a;
	while (b)
	{
		if (b&1) res=1ll*res*mul%mod;
		mul=1ll*mul*mul%mod,b>>=1;
	}
	return res;
}
void Adder(int &x,int d)
{
	x+=d;
	if (x>=mod) x-=mod;
	return;
}
void Adder2(int &x,int d)
{
	x+=d;
	if (x<0) x+=mod;
	return;
}
int MD(int x)
{
	return x>=mod?x-mod:x;
}
int MD2(int x)
{
	return x<0?x+mod:x;
}
int n,k,S[1<<M],st[K+1],delta[K+1],cnt[K+1],l[K+1],r[K+1],tr[K+1],wr[K+1],F[1<<M][M+1],dp[K+1][M+1],C[N+1][M+1],ans;
char a[M+1],b[M+1];
bool used[K+1];
int main()
{
	int sl,sr,rcnt,dst;
	bool op;
	for (int i=0;i<=N;++i) C[i][0]=1;
	for (int i=1;i<=N;++i)
		for (int j=1;j<=min(i,M);++j)
			C[i][j]=MD(C[i-1][j-1]+C[i-1][j]);
	n=read(),k=read();
	for (int i=1;i<=k;++i) S[i]=(1<<26)-1;
	for (int i=0;i<26;++i) l[i]=0,r[i]=k;
	for (int i=1;i<=n;++i)
	{
		for (int j=1;j<=k;++j) cin>>a[j];
		for (int j=1;j<=k;++j) cin>>b[j];
		for (int j=0;j<26;++j) cnt[j]=used[j]=0;
		for (int j=1;j<=k;++j)
		{
			if (b[j]=='O') S[j]&=(1<<(a[j]-'A')),cnt[a[j]-'A']++;
			else
			{
				S[j]&=(((1<<26)-1)^(1<<(a[j]-'A')));
				if (b[j]=='-')
				{
					if (used[a[j]-'A'])
					{
						puts("0");
						return 0;
					}
					cnt[a[j]-'A']++;
				}
				else used[a[j]-'A']=1;
			}
		}
		for (int j=0;j<26;++j)
			if (cnt[j]||used[j])
			{
				if (used[j]) l[j]=max(l[j],cnt[j]),r[j]=min(r[j],cnt[j]);
				else l[j]=max(l[j],cnt[j]);
			}
	}
	for (int i=1;i<=k;++i)
		if (!S[i])
		{
			puts("0");
			return 0;
		}
	for (int i=1;i<=k;++i)
		for (int j=0;j<26;++j)
			if ((S[i]>>j)&1)
				st[j]|=(1<<(i-1));
	for (int i=0;i<26;++i)
	{
		r[i]=min(r[i],__builtin_popcount(st[i]));
		if (l[i]>r[i])
		{
			puts("0");
			return 0;
		}
	}
	for (int i=0;i<(1<<k);++i)
	{
		dst=rcnt=0;
		for (int j=0;j<=26;++j)
			for (int t=0;t<=k;++t)
				dp[j][t]=F[j][t]=0;
		dp[0][0]=op=1,sl=sr=0;
		for (int j=0;j<26;++j)
		{
			delta[j]=__builtin_popcount(i&st[j]),tr[j]=min(r[j],delta[j]),dst+=tr[j];
			if (l[j]>tr[j])
			{
				op=0;
				break;
			}
			for (int t=l[j];t<=tr[j];++t) F[j][t]=C[delta[j]][t];
		}
		if (dst<k||!op) continue;
		wr[26]=0;
		for (int j=25;j>=0;--j) wr[j]=wr[j+1]+l[j+1];
		for (int j=0;j<26;++j)
		{
			if (l[j]==0&&tr[j]==delta[j])
			{
				rcnt+=delta[j];
				for (int k=sl;k<=sr;++k) dp[j+1][k]=dp[j][k];
			}
			else
			{
				for (int s=sl;s<=sr;++s)
					for (int t=l[j];t<=min(k-s,tr[j]);++t)
						Adder(dp[j+1][s+t],1ll*dp[j][s]*F[j][t]%mod);
				sl+=l[j],sr=min(sr+tr[j],k-wr[j]);
			}
		}
		if (!(__builtin_popcount(((1<<k)-1)^i)&1))
		{
			for (int j=0;j<=k;++j) Adder(ans,1ll*dp[26][j]*C[rcnt][k-j]%mod);
		}
		else
		{
			for (int j=0;j<=k;++j) Adder2(ans,-1ll*dp[26][j]*C[rcnt][k-j]%mod);
		}
	}
	printf("%d\n",ans);
	return 0;
}