#include<bits/stdc++.h>
using namespace std;
template<const int mod>
struct modint{
	int x;
	modint<mod>(int o=0){x=o;}
	modint<mod> &operator = (int o){return x=o,*this;}
	modint<mod> &operator +=(modint<mod> o){return x=x+o.x>=mod?x+o.x-mod:x+o.x,*this;}
	modint<mod> &operator -=(modint<mod> o){return x=x-o.x<0?x-o.x+mod:x-o.x,*this;}
	modint<mod> &operator *=(modint<mod> o){return x=1ll*x*o.x%mod,*this;}
	modint<mod> &operator ^=(int b){
		modint<mod> a=*this,c=1;
		for(;b;b>>=1,a*=a)if(b&1)c*=a;
		return x=c.x,*this;
	}
	modint<mod> &operator /=(modint<mod> o){return *this *=o^=mod-2;}
	modint<mod> &operator +=(int o){return x=x+o>=mod?x+o-mod:x+o,*this;}
	modint<mod> &operator -=(int o){return x=x-o<0?x-o+mod:x-o,*this;}
	modint<mod> &operator *=(int o){return x=1ll*x*o%mod,*this;}
	modint<mod> &operator /=(int o){return *this *= ((modint<mod>(o))^=mod-2);}
	template<class I>friend modint<mod> operator +(modint<mod> a,I b){return a+=b;}
	template<class I>friend modint<mod> operator -(modint<mod> a,I b){return a-=b;}
	template<class I>friend modint<mod> operator *(modint<mod> a,I b){return a*=b;}
	template<class I>friend modint<mod> operator /(modint<mod> a,I b){return a/=b;}
	friend modint<mod> operator ^(modint<mod> a,int b){return a^=b;}
	friend bool operator ==(modint<mod> a,int b){return a.x==b;}
	friend bool operator !=(modint<mod> a,int b){return a.x!=b;}
	bool operator ! () {return !x;}
	modint<mod> operator - () {return x?mod-x:0;}
	modint<mod> &operator++(int){return *this+=1;}
};
typedef modint<1000000007> mint;
const int N=5e4+10;
int n,m,a[10][N];
char s[N];
int op[N],lc[N],rc[N];//表达式树 直接存字符即可因为数字<10
mint dp[N][1<<10],sum[N];
int maxst;
void dfs(int x){
	if(!x)return;
	if(op[x]<10){
		sum[x]=1;
		for(int S=0;S<maxst;S++)
			if((S>>op[x])&1)
				dp[x][S]++;
		//dp[x][1<<op[x]]=1;
		return;
	}
	dfs(lc[x]);dfs(rc[x]);
	sum[x]=sum[lc[x]]*sum[rc[x]];
	if(op[x]=='?')sum[x]*=2;
	for(int S=0;S<maxst;S++){
		if(op[x]=='<'||op[x]=='?'){
			dp[x][S]+=dp[lc[x]][S]*dp[rc[x]][S];
		}if(op[x]=='>'||op[x]=='?'){
			dp[x][S]+=dp[lc[x]][S]*sum[rc[x]]+(sum[lc[x]]-dp[lc[x]][S])*dp[rc[x]][S];
		}
	}
}
signed main(){
	scanf("%d%d",&n,&m);maxst=1ll<<m;
	for(int i=0;i<m;i++)
		for(int j=1;j<=n;j++)
			scanf("%d",&a[i][j]);
	scanf("%s",s+1);
	int len=strlen(s+1);
	int cnt=0;stack<int>s1;stack<int>s2;
	//数字栈与符号栈
	s[0]='(';s[len+1]=')';
	for(int i=0;i<=len+1;i++){
		if(isdigit(s[i])){
			s1.push(++cnt);op[cnt]=s[i]-'0';
		}
		else if(s[i]=='?'||s[i]=='<'||s[i]=='>'){
			while(s2.size()&&s2.top()!=-1){
				++cnt;
				lc[cnt]=s1.top();s1.pop();
				rc[cnt]=s1.top();s1.pop();
				op[cnt]=s2.top();s2.pop();
				s1.push(cnt);
			}
			s2.push(s[i]);
		}
		else if(s[i]=='('){
			s2.push(-1);
		}
		else if(s[i]==')'){
			while(s2.top()!=-1){
				++cnt;
				lc[cnt]=s1.top();s1.pop();
				rc[cnt]=s1.top();s1.pop();
				op[cnt]=s2.top();s2.pop();
				s1.push(cnt);
			}
			s2.pop();
		}
	}
	int rt=s1.top();
	dfs(rt);mint ans=0;
	for(int i=1;i<=n;i++){
		static pair<int,int> num[11];
		for(int j=0;j<m;j++)num[j]={a[j][i],j};
		sort(num,num+m);reverse(num,num+m);
		for(int i=0;i<m;i++){
			int st=0;
			for(int j=0;j<=i;j++)
				st|=1<<num[j].second;
			ans+=(dp[rt][st]-dp[rt][st^(1<<num[i].second)])*num[i].first;
		}
	}
	printf("%d",ans.x);
	return 0;
}