#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pll = pair<ll, ll>;
#define drep(i, cc, n) for (ll i = (cc); i <= (n); ++i)
#define rep(i, n) drep(i, 0, n - 1)
#define all(a) (a).begin(), (a).end()
#define pb push_back
#define fi first
#define se second

const ll MOD = 1000000007;
const ll INF = 1LL << 60;
const ll MAX = 2000;

ll sum(vector<ll> &bit, ll i){
    ll s = 0;
    while(i > 0){
        s += bit[i];
        s %= MOD;
        i -= i & -i;
    }
    return s;
}

void add(vector<ll> &bit, ll i, ll x){
    while(i <= MAX){
        bit[i] += x;
        bit[i] %= MOD;
        i += i & -i;
    }
}

int main(){
    ll n, k;
    cin >> n >> k;

    vector<ll> a(n);
    rep(i, n) cin >> a[i];

    string s;
    cin >> s;

    vector<ll> b(n);
    rep(i, n) b[i] = a[i];
    sort(all(b));
    b.erase(unique(all(b)), b.end());

    rep(i, n) a[i] = lower_bound(all(b), a[i]) - b.begin()+1;

    vector<vector<ll>> dp(k+1, vector<ll>(n, 0));
    //初期化
    rep(i, n) dp[0][i] = 1;

    //遷移
    for(ll i=1; i<=k; i++){
        vector<ll> max_bit(MAX+1, 0);
        vector<ll> min_bit(MAX+1, 0);
        for(ll j=0; j<n; j++){
            if(s[i-1] == '<'){
                dp[i][j] = sum(min_bit, a[j]-1);
            }else{
                dp[i][j] = sum(max_bit, (MAX-a[j])-1);
            }
            add(min_bit, a[j], dp[i-1][j]);
            add(max_bit, MAX-a[j], dp[i-1][j]);
        }
    }

    /*
    rep(i, k+1){
        rep(j, n){
            cout << dp[i][j] << " ";
        }
        cout << endl;
    }*/

    ll ans = 0;
    rep(i, n){
        ans += dp[k][i];
        ans %= MOD;
    }

    cout << ans << endl;
}