"""

dp[i][j] = i番目までで、j個の場合の数

dp[i未満][j-1] から推移できる

ただし、A[?] < A[i] or A[?] > A[i] の時だけ

K個の セグ木に載せれば解ける

"""

from sys import stdin

mod = 10**9+7

class BIT:

    def __init__(self,N,indexed): #0-indexed or 1-indexed 指定可能
        self.bit = [0] * (N+3)
        self.mode = indexed

    def add(self,a,w): #aにwを加える(1-origin)
 
        x = a + (1-self.mode)
        while x <= (len(self.bit)-1):
            self.bit[x] += w
            self.bit[x] %= mod
            x += x & (-1 * x)

        #print (self.bit)
 
    def bitsum(self,a): #ind 1～aまでの和を求める
 
        ret = 0
        x = a + (1-self.mode)
        while x > 0:
            ret += self.bit[x]
            x -= x & (-1 * x)
        return ret % mod

    def sum(self,l,r): 
 
        ret = self.bitsum(r-1) - self.bitsum(l-1)

        return ret

N,K = map(int,stdin.readline().split())

A = list(map(int,stdin.readline().split()))

s = list(stdin.readline()[:-1])

adic = {}
alis = []

for i in A:
    if i not in adic:
        adic[i] = 0
        alis.append(i)
alis.sort()

for i in range(len(alis)):
    adic[alis[i]] = i

A = [ adic[i] for i in A ]

XXX = len(adic) + 2
bit = [BIT(XXX,0) for i in range(K+1)]

for i in range(N):

    for j in range(K,0,-1):

        if s[j-1] == "<":
            now = bit[j-1].sum(0,A[i])
            bit[j].add(A[i], now % mod )

        else:
            now = bit[j-1].sum(A[i]+1,XXX)
            bit[j].add(A[i], now % mod )

    bit[0].add(A[i],1)

print (bit[K].sum(0,XXX) % mod)