#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
using ll=int;
using ld=long double;
ld pie=3.141592653589793;
ll inf=1444999994;
ll mod=1000000007;
int main(){
    ll n,k;
    cin >> n >> k;
    vector<ll>a(n);
    for (ll i = 0; i < n; i++)
    {
        cin >> a[i];
    }
    string s;
    cin >> s;
    vector<vector<ll>>dp(k+1,vector<ll>(n,0));
    vector<vector<ll>>dai(n),syo(n);
    for (ll i = 0; i < n; i++)
    {
        for (ll j = i+1; j < n; j++)
        {
            if (a[i]>a[j])
            {
                syo[i].push_back(j);
            }else if (a[i]<a[j])
            {
                dai[i].push_back(j);
            }
        }
    }
    for (ll i = 0; i < n; i++)
    {
        dp[0][i]=1;
    }
    for (ll i = 0; i < k; i++)
    {
        for (ll j = 0; j < n; j++)
        {
            if (dp[i][j]==0)
            {
                continue;
            }
            if (s[i]=='>')
            {
                for (ll k = 0; k < syo[j].size(); k++)
                {
                    dp[i+1][syo[j][k]]+=dp[i][j];
                    if (dp[i+1][syo[j][k]]>mod)
                    {
                        dp[i+1][syo[j][k]]-=mod;
                    }
                }
            }else{
                for (ll k = 0; k < dai[j].size(); k++)
                {
                    dp[i+1][dai[j][k]]+=dp[i][j];
                    if (dp[i+1][dai[j][k]]>mod)
                    {
                        dp[i+1][dai[j][k]]-=mod;
                    }
                }
            }
        }
    }
    ll ans=0;
    for (ll i = 0; i <n; i++)
    {
        ans+=dp[k][i];
        ans%=mod;
    }
    cout << ans << endl;
}