class SegmrntTree:
    
    def __init__(self,arr,func,i_ele):
        self.i_ele = i_ele
        self.func = func
        arr_len = len(arr)
        self.tree_len = 2 ** (arr_len-1).bit_length()  * 2
        self.tree = [i_ele] * self.tree_len
        for i in range(arr_len):
            self.tree[i + self.tree_len // 2] = arr[i]
        for i in range(self.tree_len // 2 -1,0,-1):
            self.tree[i] = func(self.tree[i * 2],self.tree[i * 2 + 1])
    
    def query_range(self,l,r):
        res = self.i_ele
        l += self.tree_len // 2 - 1
        r += self.tree_len // 2 
        while l < r:
            if l & 1:
                res = self.func(res,self.tree[l])
                l += 1
            if r & 1:
                res = self.func(res,self.tree[r-1])
                r -= 1
            l >>= 1
            r >>= 1
        return res
    
    def query(self,l):
        return self.tree[l + self.tree_len // 2 - 1]
    
    def update(self,l,x):
        l += self.tree_len // 2 - 1
        self.tree[l] = self.func(x,self.tree[l])
        def calc(l):
            if l & 1:
                l -=1
            return l >> 1
        while calc(l):
            if l & 1:
                self.tree[calc(l)] = self.func(self.tree[l],self.tree[l-1])
            else:
                self.tree[calc(l)] = self.func(self.tree[l],self.tree[l+1])
            l = calc(l)

n,k = map(int,input().split())
a = list(map(int,input().split()))
s = list(input())
from collections import defaultdict
d = defaultdict(int)
d[0] = 1
for i,e in enumerate(sorted(set(a)),start=2):
    d[e] = i
d[10**20] = len(d) + 1
nn = len(d)
dp = []
mod = 10 ** 9 + 7
def sum_(x,y):
    return (x + y) % mod
for i in range(k+1):
    dp.append(SegmrntTree([0]*nn,sum_,0))


for i in range(1,n+1):
    idx = d[a[i-1]]
    dp[0].update(idx,1)
    for j in range(1,k+1):
        if s[j-1] == "<":
            down = dp[j-1].query_range(1,idx-1)
            dp[j].update(idx,down)
        else:
            up = dp[j-1].query_range(idx+1,nn)
            dp[j].update(idx,up)
#     for j in range(k+1):
#         print(dp[j].tree)
#     print()
    
ans = 0
for i in range(1,nn):
    ans += dp[k].query(i)
#     print(dp[k].query(i+1))
    ans %= mod
print(ans)