#include<bits/stdc++.h>
#include<atcoder/all>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace atcoder;
typedef long long ll;
const ll INF = 1e18;
typedef modint1000000007 mint;
//cout << fixed << setprecision(12);

int main(){
	int n, k;
	cin >> n >> k;
	vector<int> a(n);
	rep(i,n){
		cin >> a[i];
	}

	vector<int> b = a;
	sort(b.begin(), b.end());
	b.erase(unique(b.begin(), b.end()), b.end());
	unordered_map<int,int> a_c;
	for(int i=0; i<b.size(); i++){
		a_c[b[i]] = i;
	}

	vector<int> a_z(n);
	rep(i,n){
		a_z[i] = a_c[a[i]];
	}
	int azs = a_z.size();

	vector<char> s(k);
	rep(i,k){
		cin >> s[i];
	}

	vector<vector<mint>> dp(k+1,vector<mint>(n));
	rep(i,n){
		dp[0][i] = 1;
	}

	rep(num,k){
		fenwick_tree<mint> bit(azs);
		if(s[num] == '<'){
			rep(i,n){
				dp[num+1][i] += bit.sum(0, a_z[i]);
				bit.add(a_z[i], dp[num][i]);
			}
		}else{
			rep(i,n){
				dp[num+1][i] += bit.sum(a_z[i]+1, azs);
				bit.add(a_z[i], dp[num][i]);
			}
		}
	}

	mint ans = 0;
	rep(i,n){
		ans += dp[k][i];
	}
	cout << ans.val() << endl;

}