#include #include using namespace std; namespace my{ using ml=atcoder::modint1000000007; auto&operator>>(istream&i,ml&x){int t;i>>t;x=t;return i;} auto&operator<<(ostream&o,const ml&x){return o<<(int)x.val();} #define LL(...) ll __VA_ARGS__;lin(__VA_ARGS__) #define ST(...) string __VA_ARGS__;lin(__VA_ARGS__) #define VL(n,...) vec__VA_ARGS__;setsize({n},__VA_ARGS__);lin(__VA_ARGS__) #define FO(n) for(ll ij=n;ij-->0;) #define FOR(i,...) for(auto[i,i##stop,i##step]=range(0,__VA_ARGS__);isync_with_stdio(0);cout<r{0,0,1};ll I=0;((r[I++]=a),...);if(!s&&I==1)swap(r[0],r[1]);r[0]-=s;if(s)r[2]*=-1;return r;} constexpr char newline=10; constexpr char space=32; templatestruct pair{ A a;B b; pair()=default; pair(A a,B b):a(a),b(b){} pair(const std::pair&p):a(p.first),b(p.second){} auto operator<=>(const pair&)const=default; pair operator+(const pair&p)const{return{a+p.a,b+p.b};} friend istream&operator>>(istream&i,pair&p){return i>>p.a>>p.b;} friend ostream&operator<<(ostream&o,const pair&p){return o<>auto&sort(auto&a,F f={}){ranges::sort(a,f);return a;} auto&unique(auto&a){sort(a).erase(ranges::unique(a).begin(),a.end());return a;} templateauto pack_kth(const auto&...a){return get(make_tuple(a...));} templateauto pack_slice(const auto&...a){return[&](index_sequence){return array{get(forward_as_tuple(a...))...};}(make_index_sequence{});} templateconcept vectorial=is_base_of_v,V>; templatestruct vec_attr{using core_type=T;static constexpr int rank=0;}; templatestruct vec_attr{using core_type=typename vec_attr::core_type;static constexpr int rank=vec_attr::rank+1;}; templateusing core_t=vec_attr::core_type; templateistream&operator>>(istream&i,vector&v){fe(v,e)i>>e;return i;} templateostream&operator<<(ostream&o,const vector&v){fe(v,e)o<?newline:space);return o;} templatestruct vec; templatestruct tensor_helper{using type=vec::type>;}; templatestruct tensor_helper<0,T>{using type=T;}; templateusing tensor=typename tensor_helper::type; templatestruct vec:vector{ using vector::vector; vec(const vector&v){vector::operator=(v);} templaterequires(sizeof...(A)>=3)vec(A...a){const ll n=sizeof...(a)-1;auto t=pack_slice(a...);ll s[n];fo(i,n)s[i]=t[i];*this=make_vec(s,pack_kth(a...));} templatestatic auto make_vec(const ll(&s)[n],T x){if constexpr(i==n-1)return vec(s[i],x);else{auto X=make_vec(s,x);return vec(s[i],X);}} vec&operator^=(const vec&u){this->insert(this->end(),u.begin(),u.end());return*this;} vec operator^(const vec&u)const{return vec{*this}^=u;} vec&operator+=(const vec&u){vec&v=*this;assert(v.size()==u.size());fo(i,v.size())v[i]+=u[i];return v;} vec&operator-=(const vec&u){vec&v=*this;assert(v.size()==u.size());fo(i,v.size())v[i]-=u[i];return v;} vec operator+(const vec&u)const{return vec{*this}+=u;} vec operator-(const vec&u)const{return vec{*this}-=u;} vec&operator++(){fe(*this,e)++e;return*this;} vec&operator--(){fe(*this,e)--e;return*this;} vec operator-()const{vec v=*this;fe(v,e)e=-e;return v;} vec&operator%=(auto M){vec&v=*this;fe(v,e)e%=M;return v;} vec operator%(auto M)const{return vec{*this}%=M;} ll size()const{return vector::size();} auto lower_bound(const V&x)const{return std::lower_bound(this->begin(),this->end(),x);} ll arg_lower_bound(const V&x)const{return lower_bound(x)-this->begin();} auto scan(const auto&f)const{pair,bool>r{};fe(*this,e)if constexpr(!vectorial)r.b?f(r.a,e),r:r={e,1};else if(auto s=e.scan(f);s.b)r.b?f(r.a,s.a),r:r=s;return r;} auto sum()const{return scan([](auto&a,const auto&b){a+=b;}).a;} template>auto sort(F f={})const{vec v=*this;ranges::sort(v,f);return v;} auto unique()const{auto r=sort();r.erase(ranges::unique(r).begin(),r.end());return r;} auto zip()const{auto v=unique();vecr(size());fo(i,size())r[i]=v.arg_lower_bound((*this)[i]);return r;} }; templaterequires(sizeof...(A)>=2)vec(A...a)->vec(declval>()))>>>; vec(ll)->vec; templatevoid setsize(const ll(&l)[n],A&...a){((a=vec::make_vec(l,core_t{})),...);} void lin(auto&...a){(cin>>...>>a);} templatevoid pp(const auto&...a){ll n=sizeof...(a);((cout<0,c)),...);cout<struct fenwick_tree{ ll n; vecdata; fenwick_tree(ll n):n(n),data(n){} fenwick_tree(const vec&a):n(n),data(n){fo(i,n)add(i,a[i]);} ll size()const{return n;} void add(ll i,T x){ assert(0<=i&&i0)res+=data[r-1],r-=r&-r; while(l>0)res-=data[l-1],l-=l&-l; return res; } T all_sum()const{return sum(0,n);} T get(ll i)const{assert(0<=i&&i(M)); vec dp(N+1,K+2,ml{}); fo(i,N){ dp[i][1]=1; fo(j,2,K+2){ if(s[j-2]=='<')dp[i][j]=ft[j-1].sum(0,a[i]); else dp[i][j]=ft[j-1].sum(a[i]+1,M); } fo(j,1,K+2)ft[j].add(a[i],dp[i][j]); } pp(ft[K+1].all_sum()); }}