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

class BIT:
    def __init__(self, N):
        self.N = N
        self.bit = [0] * (N + 1)
        self.b = 1 << N.bit_length() - 1

    def add(self, a, w):
        x = a + 1
        while(x <= self.N):
            self.bit[x] += w
            x += x & -x

    def sum(self, a):
        ret, x = 0, a
        while(x > 0):
            ret += self.bit[x]
            x -= x & -x
        return ret

    def rsum(self, l, r):
        return self.sum(r) - self.sum(l)
    
'''
Main Code
'''

N, K = map(int, input().split())
a = list(map(int, input().split()))
s = input()[:-1]

di = { x : i for i, x in enumerate(sorted(set(a))) }
for i, x in enumerate(a):
    a[i] = di[x]

dp = [[0] * N for _ in [0] * (K + 1)]
dp[0] = [1] * N
for i, c in enumerate(s, 1):
    bt = BIT(N)
    for j, x in enumerate(a):
        bt.add(x, dp[i - 1][j])
        if(c == '<'):
            dp[i][j] = bt.sum(x) % MOD
        else:
            dp[i][j] = bt.rsum(x + 1, N) % MOD
ans = sum(dp[K]) % MOD
print(ans)