#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
using mint = modint1000000007;
const int mod = 1000000007;
//using mint = modint998244353;
//const int mod = 998244353;
//const int INF = 1e9;
//const long long LINF = 1e18;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep2(i,l,r)for(int i=(l);i<(r);++i)
#define rrep(i, n) for (int i = (n-1); i >= 0; --i)
#define rrep2(i,l,r)for(int i=(r-1);i>=(l);--i)
#define all(x) (x).begin(),(x).end()
#define allR(x) (x).rbegin(),(x).rend()
#define endl "\n"
#define P pair<int,int>
template<typename A, typename B> inline bool chmax(A & a, const B & b) { if (a < b) { a = b; return true; } return false; }
template<typename A, typename B> inline bool chmin(A & a, const B & b) { if (a > b) { a = b; return true; } return false; }
mint op(mint a, mint b) { return a + b; }
mint e() { return 0; }
int main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	int n, k; cin >> n >> k;
	vector<int>a(n);
	rep(i, n)cin >> a[i];
	string s; cin >> s;
	auto tmp = a;
	sort(all(tmp));
	tmp.erase(unique(all(tmp)), tmp.end());
	rep(i, n) a[i] = lower_bound(all(tmp), a[i]) - tmp.begin();
	int sz = tmp.size();
	vector<segtree<mint, op, e>>seg(k + 1);
	rep(i, k + 1) {
		segtree<mint, op, e>tmp(sz);
		swap(tmp, seg[i]);
	}
	rep(i, n) {
		auto now = seg[0].get(a[i]);
		seg[0].set(a[i], now + 1);
		rep(j, k) {
			if ('<' == s[j]) {
				auto get = seg[j].prod(0, a[i]);
				auto now = seg[j + 1].get(a[i]);
				seg[j + 1].set(a[i], get + now);
			}
			else {
				auto get = seg[j].prod(a[i] + 1, sz);
				auto now = seg[j + 1].get(a[i]);
				seg[j + 1].set(a[i], get + now);
			}
		}
	}
	mint ans = seg[k].all_prod();
	cout << ans.val() << endl;
	return 0;
}