class Compression:
    def __init__(self, iterable):
        self.vs = sorted(set(iterable))
        self.v2i = {}
        for i, val in enumerate(self.vs):
            self.v2i[val] = i

    def __len__(self):
        return len(self.vs)

    def index(self, val):
        """val のインデックスを返す"""
        return self.v2i[val]

    def value(self, index):
        """インデックスに対応する値を返す"""
        return self.vs[index]


class FenwickTree:
    def __init__(self, n: int):
        self.data = [0] * (n+10)
        self.n = (n+10)

    def add(self, p: int, x: int):
        assert 0 <= p < self.n
        p += 1
        while p < len(self.data):
            self.data[p] += x
            p += p & -p

    def sum(self, p: int) -> int:
        """区間 [0, p] の和"""
        assert 0 <= p < self.n
        p += 1
        s = 0
        while p > 0:
            s += self.data[p]
            p -= p & -p
        return s

    def rangesum(self, l: int, r: int) -> int:
        """区間 [l, r] の和"""
        assert 0 <= l <= r < self.n
        s = self.sum(r)
        if l > 0:
            s -= self.sum(l-1)
        return s


MOD = 10**9 + 7
N, K = map(int, input().split())
A = list(map(int, input().split()))
S = input()

comp = Compression(A)

dp = [1] * N
for c in S:
    pp = [0] * N
    dp, pp = pp, dp
    ft = FenwickTree(len(comp)+10)
    if c == '<':
        for i, a in enumerate(A):
            p = comp.index(a) + 1
            ft.add(p, pp[i])
            dp[i] = ft.sum(p-1)
            dp[i] %= MOD
    else:
        for i, a in enumerate(A):
            p = comp.index(a) + 1
            ft.add(p, pp[i])
            dp[i] = ft.rangesum(p+1, len(comp)+10)
            dp[i] %= MOD

ans = sum(dp) % MOD
print(ans)