#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <atcoder/modint>
#include <atcoder/fenwicktree>

using namespace std;
using i32 = int32_t;
using u32 = uint32_t;
using i64 = int64_t;
using u64 = uint64_t;
#define rep(i,n) for(int i=0; i<(int)(n); i++)


const i64 INF = 1001001001001001001;
using modint = atcoder::static_modint<1000000007>;


int main(){
	int N; cin >> N;
	int K; cin >> K;
	vector<int> A(N);
	rep(i,N) cin >> A[i];
	string S; cin >> S;

	vector<int> I(N); rep(i,N) I[i] = i;
	sort(I.begin(), I.end(), [&](int l, int r) -> bool { return make_pair(A[l], -l) < make_pair(A[r], -r); });
	vector<int> rI(N); rep(i,N) rI[i] = i;
	sort(rI.begin(), rI.end(), [&](int l, int r) -> bool { return make_pair(-A[l], -l) < make_pair(-A[r], -r); });

	vector<modint> dp(N, 1);
	for(char c : S){
		if(c == '>') swap(I, rI);
		atcoder::fenwick_tree<modint> rq(N);
		vector<modint> dptmp(N, 0);
		for(int i : I){
			dptmp[i] = rq.sum(0, i);
			rq.add(i, dp[i]);
		}
		if(c == '>') swap(I, rI);
		swap(dp, dptmp);
	}

	modint ans = 0;
	for(auto a : dp) ans += a;
	cout << ans.val() << '\n';
    return 0;
}


struct ios_do_not_sync{
    ios_do_not_sync(){
        std::ios::sync_with_stdio(false);
        std::cin.tie(nullptr);
    }
} ios_do_not_sync_instance;