P = 10 ** 9 + 7

#BIT plus ver
class BITplus:
    def __init__(self,N):
        self.N = N
        self.bit = [0] * (self.N+1)
    def add(self,i,x):
        while i <= self.N:
            self.bit[i] += x
            self.bit[i] %= P
            i += i & -i
    def fold(self,i):
        ans = 0
        while i > 0:
            ans += self.bit[i]
            i -= i & -i
        return ans % P
    def lb(self,w):
        if w <= 0:return 0
        x = 0
        k = 1
        while k <= self.N:
            k <<= 1
        k >>= 1
        while k:
            if x + k <= self.N and self.bit[x+k] < w:
                w -= self.bit[x+k]
                x += k
            k >>= 1
        return x + 1

    #サイズ N の配列をいれる
    def build(self,seq):
        bit = self.bit
        N = self.N
        for i in range(N):
            bit[i+1] = seq[i]
        for i in range(1,N+1):
            if i + (i & -1) <= N:
                bit[i + (i & -i)] += bit[i]

N,K = map(int,input().split())
A = list(map(int,input().split()))
rD = sorted(set(A))
D = {v:i + 1 for i,v in enumerate(rD)}
n = len(D)
bit = [BITplus(n) for _ in range(K + 2)]
s = input()
for a in A:
    bit[1].add(D[a],1)
    for k in range(2,K + 2):
        if s[k - 2] == "<":
            tmp = bit[k-1].fold(D[a] - 1)
            bit[k].add(D[a],tmp)
        else:
            tmp = bit[k-1].fold(n) - bit[k-1].fold(D[a])
            bit[k].add(D[a],tmp)
ans = bit[-1].fold(n)
print(ans)