## https://yukicoder.me/problems/no/1996 MOD = 10 ** 9 + 7 class BinaryIndexTree: """ フェニック木(BinaryIndexTree)の基本的な機能を実装したクラス """ def __init__(self, size): self.size = size self.array = [0] * (size + 1) def add(self, x, a): index = x while index <= self.size: self.array[index] += a self.array[index] %= MOD index += index & (-index) def sum(self, x): index = x ans = 0 while index > 0: ans += self.array[index] ans %= MOD index -= index & (-index) return ans def least_upper_bound(self, value): if self.sum(self.size) < value: return -1 elif value <= 0: return 0 m = 1 while m < self.size: m *= 2 k = 0 k_sum = 0 while m > 0: k0 = k + m if k0 < self.size: if k_sum + self.array[k0] < value: k_sum += self.array[k0] k += m m //= 2 if k < self.size: return k + 1 else: return -1 def main(): N, K = map(int, input().split()) A = list(map(int, input().split())) S = input() # 座標圧縮 a_list = list(set(A)) a_list.sort() a_map = {} for i, a in enumerate(a_list): a_map[a] = i + 1 a_max = len(a_list) dp_bits = [BinaryIndexTree(a_max) for _ in range(K + 1)] for a in A: a_ = a_map[a] for k in reversed(range(K + 1)): if k == 0: dp_bits[k].add(a_, 1) else: if S[k - 1] == "<": x = dp_bits[k - 1].sum(a_ - 1) dp_bits[k].add(a_, x) else: x = dp_bits[k - 1].sum(dp_bits[k - 1].size) - dp_bits[k - 1].sum(a_) x %= MOD dp_bits[k].add(a_, x) print(dp_bits[-1].sum(dp_bits[-1].size)) if __name__ == "__main__": main()