#include <bits/stdc++.h>
using namespace std;

#define pb push_back
#define eb emplace_back
#define mp make_pair
#define mt make_tuple

using ll = long long;
using ii = pair<int, int>;

const int MOD = (int)1e9 + 7;
int n, m, ans, A[15][50005], mat[50005];
string S, T;
stack<int> st;

ii g(int l, int r) {
	if (l == r) {
		assert(T[l] == '0' || T[l] == '1');
		return mp(T[l] == '0', T[l] == '1');
	}
	if (T[l] == '(' && mat[l] == r) {
		return g(l + 1, r - 1);
	}
	int pos;
	if (T[r] == ')') {
		pos = mat[r] - 1;
	} else {
		pos = r - 1;
	}
	assert(T[pos] == '<' || T[pos] == '>' || T[pos] == '?');
	auto lft = g(l, pos - 1), rig = g(pos + 1, r);
	ii  ret1 = mp(((ll)lft.first * rig.first % MOD + (ll)lft.first * rig.second % MOD + (ll)lft.second * rig.first % MOD) % MOD, (ll)lft.second * rig.second % MOD),
		ret2 = mp((ll)lft.first * rig.first % MOD, ((ll)lft.first * rig.second % MOD + (ll)lft.second * rig.first % MOD + (ll)lft.second * rig.second % MOD) % MOD),
		ret3 = mp((ret1.first + ret2.first) % MOD, (ret1.second + ret2.second) % MOD);
	ii ret;
	if (T[pos] == '<') {
		ret = ret1;
	} else if (T[pos] == '>') {
		ret = ret2;
	} else {
		ret = ret3;
	}
	return ret;
}

int f(int v, int c) {
	for (int i = 0; i < (int)S.size(); i++) {
		if ('0' <= S[i] && S[i] <= '9') {
			T[i] = (A[S[i] - '0'][c] >= v) + '0';
		} else {
			T[i] = S[i];
		}
	}
	return g(0, (int)T.size() - 1).second;
}

int main() {
	ios::sync_with_stdio(0);
	cin.tie(0);
	cin >> n >> m;
	for (int i = 0; i < m; i++) {
		for (int j = 1; j <= n; j++) {
			cin >> A[i][j];
		}
	}
	cin >> S;
	T.resize(S.size());
	for (int i = 0; i < (int)S.size(); i++) {
		if (S[i] == ')') {
			mat[i] = st.top();
			mat[st.top()] = i;
			st.pop();
		} else if (S[i] == '(') {
			st.push(i);
		}
	}
	for (int j = 1; j <= n; j++) {
		vector<int> nums;
		for (int i = 0; i < m; i++) {
			nums.pb(A[i][j]);
		}
		sort(nums.begin(), nums.end(), greater<int>());
		nums.erase(unique(nums.begin(), nums.end()), nums.end());
		for (int i = 0, prv = 0; i < (int)nums.size(); i++) {
			int cur = f(nums[i], j);
			ans = (ans + (ll)(cur - prv) * nums[i] % MOD) % MOD;
			prv = cur;
		}
	}
	cout << ans << '\n';
}