#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i,n) for (int i = 0; i < n; i++)
#define rrep(i,n) for (int i = n-1; i >= 0; i--)
#define rep2(i,a,b) for (int i = a; i < b; i++)
#define rrep2(i,a,b) for (int i = a-1; i >= b; i--)
#define rep3(i,a,b,c) for (int i = a; i < b; i+=c)
#define rrep3(i,a,b,c) for (int i = a-1; i >= b; i-=c)
#define all(v) v.begin(),v.end()
#define rall(v) v.rbegin(),v.rend()
template<class T> bool chmax(T &a, T b){if (a < b){a = b;return true;} else return false;}
template<class T> bool chmin(T &a, T b){if (a > b){a = b;return true;} else return false;}

const int MOD=1e9+7;

template <class S, S (*op)(S, S), S (*e)()>
struct segtree{
    int n;
    vector<S> dat;
    segtree(int N){
        int x = 1;
        while (x < N) x *= 2;
        n = x;
        dat.resize(2*n-1, e());
    }
    void set(int i, S x){
        assert(i>=0&&i<n);
        i += n-1;
        dat[i] = x;
        while (i > 0){
            i = (i-1)/2;
            dat[i] = op(dat[2*i+1], dat[2*i+2]);
        }
    }
    S get(int i){
        assert(i>=0&&i<n);
        i += n-1;
        return dat[i];
    }
    S prod(int a, int b, int k = 0, int l = 0, int r = -1){
        if (r < 0) r = n;
        if (r <= a || l >= b) return e();
        if (l >= a && r <= b) return dat[k];
        else{
            S vl = prod(a, b, 2*k+1, l, (l+r)/2);
            S vr = prod(a, b, 2*k+2, (l+r)/2, r);
            return op(vl, vr);
        }
    }
};

ll op(ll l,ll r){
    return (l+r)%MOD;
}

ll e(){
    return 0;
}

int k,n;
ll A[1500];
char C[1500];
int main(){
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    cin>>n>>k;
    vector<int>V;
    rep(i,n){
        cin>>A[i];
        V.push_back(A[i]);
    }
    sort(all(V));
    V.erase(unique(all(V)),V.end());
    map<int,int>mp;
    rep(i,V.size())mp[V[i]]=i;
    rep(i,n)A[i]=mp[A[i]];
    rep(i,k)cin>>C[i];
    vector<segtree<ll,op,e>>Seg(k+1,segtree<ll,op,e>(n+1));
    rep(i,n){
        Seg[0].set(A[i],1);
        rep(j,k){
            if(C[j]=='<'){
                Seg[j+1].set(A[i],Seg[j+1].get(A[i])+Seg[j].prod(0,A[i]));
            }else{
                Seg[j+1].set(A[i],Seg[j+1].get(A[i])+Seg[j].prod(A[i]+1,n+1));
            }
        }
    }
    ll ans=0;
    rep(i,n+1){
        ans+=Seg[k].get(i);
        ans%=MOD;
    }
    cout<<ans<<"\n";
}