#include <bits/stdc++.h>
using namespace std;
//*
#include <atcoder/all>
using namespace atcoder;
//using mint = modint998244353;
using mint = modint1000000007;
//*/
using ll = long long;
using ld = long double;
using pll = pair<ll, ll>;
using tlll = tuple<ll, ll, ll>;
constexpr ll INF = 1LL << 60;
template<class T> bool chmin(T& a, T b) {if (a > b) {a = b; return true;} return false;}
template<class T> bool chmax(T& a, T b) {if (a < b) {a = b; return true;} return false;}
ll safemod(ll A, ll M) {ll res = A % M; if (res < 0) res += M; return res;}
ll divfloor(ll A, ll B) {if (B < 0) {return divfloor(-A, -B);} return (A - safemod(A, B)) / B;}
ll divceil(ll A, ll B) {if (B < 0) {return divceil(-A, -B);} return divfloor(A + B - 1, B);}
ll mypowl(ll A, ll B) {ll res = 1; for (int i = 0; i < B; i++) {res *= A;} return res;}
template<class T> void unique(vector<T> &V) {V.erase(unique(V.begin(), V.end()), V.end());}
template<class T> void sortunique(vector<T> &V) {sort(V.begin(), V.end()); V.erase(unique(V.begin(), V.end()), V.end());}
#define FINALANS(A) do {cout << (A) << '\n'; exit(0);} while (false)
template<class T> void printvec(const vector<T> &V) {int _n = V.size(); for (int i = 0; i < _n; i++) cout << V[i] << (i == _n - 1 ? "" : " ");cout << '\n';}
template<class T> void printvect(const vector<T> &V) {for (auto v : V) cout << v << '\n';}
template<class T> void printvec2(const vector<vector<T>> &V) {for (auto &v : V) printvec(v);}

template <class T>
vector<T> zarts_light(const vector<T> &V, int cnt = 0)
{
  vector<T> W = vector<T>(V);
  sortunique(W);
  vector<T> res(V.size());
  for (int i = 0; i < (int)V.size(); i++)
  {
    res[i] = cnt + lower_bound(W.begin(), W.end(), V[i]) - W.begin();
  }
  return res;
}

int main()
{
  ll N, K;
  cin >> N >> K;
  vector<ll> A(N);
  for (ll i = 0; i < N; i++)
  {
    cin >> A.at(i);
  }
  string S;
  cin >> S;
  A = zarts_light(A);

  vector dp(K + 1, vector(N, mint(0)));
  for (ll i = 0; i < N; i++)
  {
    dp.at(0).at(i) = 1;
  }
  for (ll j = 0; j < K; j++)
  {
    fenwick_tree<mint> fw(N);
    for (ll i = 0; i < N; i++)
    {
      if (S.at(j) == '<')
        dp.at(j + 1).at(i) = fw.sum(0, A.at(i));
      else
        dp.at(j + 1).at(i) = fw.sum(A.at(i) + 1, N);
      fw.add(A.at(i), dp.at(j).at(i));
    }
  }
  mint ans = 0;
  for (ll i = 0; i < N; i++)
  {
    mint tmp = dp.at(K).at(i);
    ans += tmp;
  }
  cout << ans.val() << endl;

  /*
  for (ll j = 0; j < K + 1; j++)
  {
    for (ll i = 0; i < N; i++)
    {
      cerr << j << " " << i << "  " << dp.at(j).at(i).val() << endl;
    }
  }
  //*/
}