#include <bits/stdc++.h>
using namespace std;

#ifdef _RUTHEN
#include "debug.hpp"
#else
#define show(...) true
#endif

using ll = long long;
#define rep(i, n) for (int i = 0; i < (n); i++)
template <class T> using V = vector<T>;

#include <atcoder/fenwicktree>
#include <atcoder/modint>
using mint = atcoder::modint1000000007;

int main() {
    ios::sync_with_stdio(false);
    cin.tie(0);
    int N, K;
    cin >> N >> K;
    V<int> A(N);
    rep(i, N) cin >> A[i];
    string S;
    cin >> S;
    V<int> B = A;
    sort(B.begin(), B.end());
    B.erase(unique(B.begin(), B.end()), B.end());
    rep(i, N) A[i] = lower_bound(B.begin(), B.end(), A[i]) - B.begin();
    int M = B.size();
    V<mint> dp(N, 1);
    rep(i, K) {
        V<mint> np(N, 0);
        atcoder::fenwick_tree<mint> fen(M);
        rep(j, N) {
            // xi = jとする
            if (S[i] == '<') {
                np[j] = fen.sum(0, A[j]);
            } else {
                np[j] = fen.sum(A[j] + 1, M);
            }
            fen.add(A[j], dp[j]);
        }
        dp = np;
    }
    mint ans = accumulate(dp.begin(), dp.end(), mint(0));
    cout << ans.val() << '\n';
    return 0;
}