#include<bits/stdc++.h>
#define ff first
#define ss second
#define pb push_back
typedef long long ll;
using namespace std;
typedef pair<int,int> pii;

const int mod=1e9+7;
inline int add(int x,int y){int ret=x+y;if(ret>=mod)ret-=mod;return ret;}
inline int sub(int x,int y){int ret=x-y;if(ret<0)ret+=mod;return ret;}
inline int mul(int x,int y){return ((ll)x*y)%mod;}
inline int step(int base,int pw){int ret=1;while(pw){if(pw&1)ret=mul(ret,base);base=mul(base,base);pw>>=1;}return ret;}
inline int invv(int x){return step(x,mod-2);}


const int maxn=1e4+10;
const int maxk=19;
const int maxalp=26;

int n,k;

struct cond{

    int vset[maxk];
    int minv[maxalp];
    bool iseq[maxalp];
    int okay=1;

    cond(){}
    cond(string a,string b){

        for(int i=0;i<k;i++){
            if(b[i]=='O'){
                vset[i]=(1<<(a[i]-'A'));
            }
            else{
                vset[i]=(1<<maxalp)-1-(1<<(a[i]-'A'));
            }
        }

        for(int i=0;i<maxalp;i++){

            int cnt=0;
            int flag=0;
            for(int j=0;j<k;j++){
                if(a[j]-'A'!=i)continue;
                if(flag && b[j]=='-'){
                    okay=0;
                    return;
                }

                if(b[j]=='-' || b[j]=='O')cnt++;
                else flag=1;
            }

            iseq[i]=flag;
            minv[i]=cnt;

        }
    }

    cond operator +(cond b){

        cond ret=(*this);
        ret.okay&=b.okay;

        for(int i=0;i<k;i++){
            ret.vset[i]&=b.vset[i];
            if(ret.vset[i]==0)ret.okay=0;
        }

        for(int i=0;i<maxalp;i++){

            ret.minv[i]=max(ret.minv[i],b.minv[i]);
            ret.iseq[i]=max(ret.iseq[i],b.iseq[i]);

            if(iseq[i]){
                if(ret.minv[i]!=minv[i])ret.okay=0;
            }
            if(b.iseq[i]){
                ///printf("%d %d %d OP\n",ret.minv[i],b.minv[i],minv[i]);
                if(ret.minv[i]!=b.minv[i])ret.okay=0;
            }
        }

        return ret;
    }

    int getsum(){
        int ret=0;
        for(int i=0;i<maxalp;i++)ret+=minv[i];
        return ret;
    }

    void ispis(){

        for(int i=0;i<k;i++){
            for(int j=0;j<maxalp;j++){
                if(vset[i]&(1<<j))printf("1");
                else printf("0");
            }
            printf("\n");
        }
        for(int i=0;i<maxalp;i++)printf("%d %d | ",minv[i],iseq[i]);
        printf("\n ok = %d   ISPIS\n",okay);
    }

}g;

int pref[maxalp],letmask[maxalp];
int dp[(1<<maxk)][maxk];
int go(int mask,int pos){

    if(pos==k){
        for(int i=0;i<maxalp;i++){
            int cnt=__builtin_popcount(letmask[i]&mask);
            if(cnt<g.minv[i])return 0;
        }
        return 1;
    }
    if(dp[mask][pos]!=-1)return dp[mask][pos];

    int &a=dp[mask][pos];
    a=0;

    for(int i=0;i<maxalp;i++){
        if((g.vset[pos]&(1<<i))==0)continue;
        int cnt=__builtin_popcount(letmask[i]&mask);
        if(g.iseq[i] && cnt==g.minv[i])continue;

        if(cnt<g.minv[i])a=add(a,go(mask|(1<<(pref[i]+cnt)),pos+1));
        else a=add(a,go(mask,pos+1));
    }


    return a;
}

int main(){

    ///freopen("test.txt","r",stdin);

    scanf("%d %d",&n,&k);

    memset(dp,-1,sizeof(dp));

    cond c;
    for(int i=1;i<=n;i++){
        string a,b;
        cin>>a>>b;
        if(i==1)c=cond(a,b);
        else c=c+cond(a,b);

        //c.ispis();
        //cond(a,b).ispis();
    }

    if(c.okay==0 || c.getsum()>k){
        printf("0\n");
        return 0;
    }

    g=c;

    ///g.ispis();

    for(int i=1;i<maxalp;i++){
        pref[i]=g.minv[i-1]+pref[i-1];
    }
    for(int i=0;i<maxalp;i++){
        int d=g.minv[i];
        int mask=(1<<d)-1;
        letmask[i]=(mask<<pref[i]);
    }

    printf("%d\n",go(0,0));

    return 0;
}