// g++ -std=c++11 a.cpp
#include<iostream>
#include<vector>
#include<string>
#include<algorithm>	
#include<map>
#include<set>
#include<unordered_map>
#include<utility>
#include<cmath>
#include<random>
#include<cstring>
#include<queue>
#include<stack>
#include<bitset>
#include<cstdio>
#include<sstream>
#include<iomanip>
#include<assert.h>
#include<typeinfo>
#define loop(i,a,b) for(int i=a;i<b;i++) 
#define rep(i,a) loop(i,0,a)
#define FOR(i,a) for(auto i:a)
#define pb push_back
#define all(in) in.begin(),in.end()
#define shosu(x) fixed<<setprecision(x)
#define show1d(v) rep(i,v.size())cout<<" "<<v[i];cout<<endl<<endl;
#define show2d(v) rep(i,v.size()){rep(j,v[i].size())cout<<" "<<v[i][j];cout<<endl;}cout<<endl;
using namespace std;
//kaewasuretyuui
typedef long long ll;
//#define int ll
typedef int Def;
typedef pair<Def,Def> pii;
typedef vector<Def> vi;
typedef vector<vi> vvi;
typedef vector<pii> vp;
typedef vector<vp> vvp;
typedef vector<string> vs;
typedef vector<double> vd;
typedef vector<vd> vvd;
typedef pair<Def,pii> pip;
typedef vector<pip>vip;
//#define mt make_tuple
//typedef tuple<int,int,int> tp;
//typedef vector<tp> vt;
template<typename A,typename B>bool cmin(A &a,const B &b){return a>b?(a=b,true):false;}
template<typename A,typename B>bool cmax(A &a,const B &b){return a<b?(a=b,true):false;}
//template<class C>constexpr int size(const C &c){return (int)c.size();}
//template<class T,size_t N> constexpr int size(const T (&xs)[N])noexcept{return (int)N;}
const double PI=acos(-1);
const double EPS=1e-9;
Def inf = sizeof(Def) == sizeof(long long) ? 2e18 : 1e9+10;
int dx[]={0,1,0,-1};
int dy[]={1,0,-1,0};//ESWN
int used[350][52][52][4];
int n,m,cnt=0,h=0;
vs in;
int x,y,to,t=0;
string s;
bool F(char c){
	if(c=='N'&&to==3)return true;
	if(c=='E'&&to==0)return true;
	if(c=='S'&&to==1)return true;
	if(c=='W'&&to==2)return true;
	if(c=='T')return true;
	if(c=='C'){
		int nx=x+dx[to];
		int ny=y+dy[to];
		if(in[nx][ny]=='#')return true;
	}
	return false;
}
void f(int a){
	while(t<s.size()&&!h){
//		cout<<x<<" "<<y<<" "<<to<<" "<<t<<endl;
		if(in[x][y]=='g'){
			cout<<cnt<<endl;
			exit(0);
		}
		if(s[t]=='^'){
			cnt++;
			x+=dx[to];y+=dy[to];
			if(in[x][y]=='#'){
				x-=dx[to];y-=dy[to];
			}
		}else if(s[t]=='v'){
			cnt++;
			x-=dx[to];y-=dy[to];
			if(in[x][y]=='#'){
				x+=dx[to];y+=dy[to];
			}
		}else if(s[t]=='>'){
			cnt++;
			(to+=1)%=4;
		}else if(s[t]=='<'){
			cnt++;
			(to+=3)%=4;
		}else if(s[t]=='['){
			t++;
			bool H=false;
			if(s[t]=='~'){
				H=true;
				t++;
			}
			char c=s[t];
			t++;
			if(F(c)^H){
				f(a+1);
			}else{
				int co=0;
				while(s[t]!=']'||co){
					if(s[t]=='[')co++;
					if(s[t]==']')co--;
					t++;
				}
			}
		}else if(s[t]=='{'){
			rep(i,n)rep(j,m)rep(k,4)
				used[a][i][j][k]=0;
			t++;
			bool H=false;
			if(s[t]=='~'){
				H=true;
				t++;
			}
			char c=s[t];
			t++;
			int nt=t;
			while(F(c)^H){
				t=nt;
				if(used[a][x][y][to]){
					h=true;
					break;
				}
				used[a][x][y][to]=1;
				f(a+1);
			}
			int co=0;
			while(s[t]!='}'||co){
				if(s[t]=='{')co++;
				if(s[t]=='}')co--;
				t++;
			}
		}else break;
		t++;
	}
}
int main(){
	cin>>n>>m;
	in=vs(n);
	rep(i,n)cin>>in[i];cin>>s;
	
	rep(i,n)rep(j,m)if(in[i][j]=='s'){
		x=i,y=j,to=3;
	}
	f(0);
	cout<<-1<<endl;
}








Measured memory_bytes: 5416