#include <bits/stdc++.h>
using namespace std;
#define F first
#define S second
#define R cin>>
#define ll long long
#define ln cout<<'\n'
#define in(a) insert(a)
#define pb(a) push_back(a)
#define pd(a) printf("%.10f\n",a)
#define mem(a) memset(a,0,sizeof(a))
#define all(c) (c).begin(),(c).end()
#define iter(c) __typeof((c).begin())
#define rrep(i,n) for(ll i=(ll)(n)-1;i>=0;i--)
#define REP(i,m,n) for(ll i=(ll)(m);i<(ll)(n);i++)
#define rep(i,n) REP(i,0,n)
#define tr(it,c) for(iter(c) it=(c).begin();it!=(c).end();it++)
ll check(ll n,ll m,ll x,ll y){return x>=0&&x<n&&y>=0&&y<m;}void pr(){ln;}
template<class A,class...B>void pr(const A &a,const B&...b){cout<<a<<(sizeof...(b)?" ":"");pr(b...);}
template<class A>void PR(A a,ll n){rep(i,n)cout<<(i?" ":"")<<a[i];ln;}
const ll MAX=1e9+7,MAXL=1LL<<61,dx[8]={-1,0,1,0,-1,-1,1,1},dy[8]={0,1,0,-1,-1,1,1,-1};
typedef pair<ll,ll> P;

class BIT{
public:
  ll n,bit[5555];
  void init(ll m){n=m;fill(bit,bit+n,0);}
  void add(ll i,ll x){
    while(i<=n){
      bit[i]+=x;
      bit[i]%=MAX;
      i+=i&-i;
    }
  }
  ll sum(ll i){
    ll s=0;
    while(i>0){
      s+=bit[i];
      s%=MAX;
      i-=i&-i;
    }
    return s;
  }
};

BIT b[2222];

void Main() {
  ll n,m;
  cin >> n >> m;
  ll a[n];
  rep(i,n) cin >> a[i];
  string s;
  cin >> s;
  set<ll> se;
  rep(i,n) se.in(a[i]);
  map<ll,ll> ma;
  tr(it,se) {
    ll k=ma.size()+1;
    ma[*it]=k;
  }
  rep(i,m+1) b[i].init(ma.size()+1);
  rep(i,n) {
    ll x=ma[a[i]];
    rrep(j,m) {
      if(s[j]=='<') {
        b[j+1].add(x,b[j].sum(x-1));
      } else {
        b[j+1].add(x,(b[j].sum(ma.size())-b[j].sum(x)+MAX)%MAX);
      }
    }
    b[0].add(x,1);
  }
  pr(b[m].sum(ma.size()));
}

int main(){ios::sync_with_stdio(0);cin.tie(0);Main();return 0;}