import sys
input = sys.stdin.readline
mod = 10 ** 9 + 7

class BIT:
	def __init__(self, n, array):
		self.size = n
		self.bit = [0] * (n + 1)
		self.alt = {}
		s = sorted(set(array))
		for i in range(len(s)):
			self.alt[s[i]] = i + 1

	def add(self, k, p):
		t = self.alt[k]
		while(t <= self.size):
			self.bit[t] += p
			self.bit[t] %= mod
			t += t & -t

	def sum(self, r):
		res, t = 0, self.alt[r] - 1
		while(t > 0):
			res += self.bit[t]
			res %= mod
			t -= t & -t
		return res


"""
Main Code
"""

N, K = map(int, input().split())
a = list(map(int, input().split()))
s = [1 if(c == '<') else 0 for c in input().rstrip()]

dp = [1] * N
for c in s:
	ndp = [0] * N
	bt = BIT(N, a)
	if(c == 1):
		for i, k in enumerate(a):
			bt.add(k, dp[i])
			ndp[i] = bt.sum(k)
			ndp[i] %= mod
	else:
		for i, k in enumerate(b):
			bt.add(k, dp[i])
			ndp[i] = bt.sum(k)
			ndp[i] %= mod
	dp = ndp[:]

ans = 0
for t in dp:
	ans += t
	ans %= mod
print(ans)