mod = 1000000007


def main():
    import sys
    input = sys.stdin.readline

    class Bit:
        def __init__(self, n):
            self.size = n
            self.tree = [0] * (n + 1)

        def sum(self, i):
            s = 0
            while i > 0:
                s += self.tree[i]
                s %= mod
                i -= i & -i
            return s

        def add(self, i, x):
            while i <= self.size:
                self.tree[i] += x
                self.tree[i] %= mod
                i += i & -i

        def lower_bound(self, w):
            if w <= 0:
                return 0
            x = 0
            k = 1 << (self.size.bit_length() - 1)
            while k:
                if x + k <= self.size and self.tree[x + k] < w:
                    w -= self.tree[x + k]
                    x += k
                k >>= 1
            return x + 1

    N, K = map(int, input().split())
    A = list(map(int, input().split()))
    S = input().rstrip('\n')

    AI_inc = [(a, i+1) for i, a in enumerate(A)]
    AI_dec = [(a, i+1) for i, a in enumerate(A)]
    AI_inc.sort(key=lambda x: x[1], reverse=True)
    AI_inc.sort(key=lambda x: x[0])
    AI_dec.sort(key=lambda x: x[1], reverse=True)
    AI_dec.sort(key=lambda x: x[0], reverse=True)

    dp = [1] * (N+1)
    for i, s in enumerate(S):
        if s == "<":
            AI = AI_inc
        else:
            AI = AI_dec
        dp_new = [0] * (N+1)
        bit = Bit(N)
        for a, i in AI:
            dp_new[i] = bit.sum(i)
            bit.add(i, dp[i])
        dp = dp_new
    ans = 0
    for x in dp:
        ans = (ans + x) % mod
    print(ans)


if __name__ == '__main__':
    main()