Problem: A robot, a wall, and a goal are installed on the board, and a program that describes the behavior pattern of the robot is given.

The given program is represented by the following EBNF.


Program: = {statement};
Statement: = if statement | while statement | action statement;
if statement: = "[", condition, program, "]";
while statement: = "{", condition, program, "}";

Action statement: = "^" | "v" | "<" | ">";
Condition: = ["~"], "N" | "E" | "S" | "W" | "C" | "T";


A "program" consists of 0 or more "sentences", and if there is one or more sentences, the sentences are executed one by one in order from the first sentence. A "statement" is one of an "action statement", an "if statement", and a "while statement". The "action statement" is one of "^", "v", "<", ">", and the following actions are executed respectively.

* "^": Advance
* "v": Retreat
* "<": Rotate 90 degrees to the left
* ">": Rotate 90 degrees to the right



The "if statement" is an arrangement of "[", "condition", "program", "]" in order, and is executed by the following procedure.

1. Determine if the content of the "condition" is true
2. If the judgment is true, execute the contents of the "program" and end the processing of this if statement.
3. If the judgment is false, the processing of this if statement ends.



A "while statement" is an arrangement of "{", "condition", "program", and "}" in order, and is executed by the following procedure.

1. Determine if the content of the "condition" is true
2. If the judgment is true, execute the contents of "Program" and return to 1.
3. If the judgment is false, the processing of this while statement ends.



The "condition" is one of "N", "E", "S", "W", "C", "T", and can be prefixed with "~". Each description represents the following boolean values.

* If "~" is added at the beginning, the boolean value is reversed.
* N: True if facing north, false otherwise
* E: True if facing east, false otherwise
* S: True if facing south, false otherwise
* W: True if facing west, false otherwise
* C: True if there is a wall in front of you, false otherwise
* T: Always true



It is assumed that the robot is initially facing north. Robots cannot pass through walls and can only move empty squares. If the program tries to perform an action that passes over a wall, the robot will not move and will stay in place. Finally, when the robot reaches the goal, it interrupts all the programs that are being executed, even if they remain, and stops the operation.

At this time, I would like to know how long it will take for the robot to reach the goal. Since the robot can execute condition judgment and program loading at a very high speed, it is only the "action statement" that determines the actual operation time. Therefore, please tell me how many times this robot executes the "motion statement" before reaching the goal.

It is considered that the "action statement" has been executed even if the action of the "action statement" is not actually performed when trying to execute an action that passes over the wall.

Constraints

* 1 ≤ H, W ≤ 50
* 1 ≤ s number of characters ≤ 1,000
* ai, j is one of ".", "#", "S", "g"
* "s" and "g" appear only once each
* If i = 1 or i = H or j = 1 or j = W, then ai, j = "#" (the outer circumference of the board is guaranteed to be surrounded by a wall)
* The program given as s is syntactically correct

Input

The input is given in the following format.


H W
a1,1a1,2 ... a1, W
a2,1a2,2 ... a2, W
:::
aH, 1aH, 2 ... aH, W
s


H is the height of the board and W is the width of the board.

Next, the state of the board viewed from directly above is given. The top, bottom, left, and right of this board correspond to north, south, west, and east, respectively. Ai and j, which represent the state of each cell, are one of the following characters.

* "s": Robot (robot initial position. This square is guaranteed to have no walls)
* "g": Goal
* "#": Wall (Robots cannot move on the wall)
* ".": An empty square



The program given to the robot is input as a character string in s.

Output

If you can reach it, output "the number of" action statements "executed before reaching it". If you cannot reach it, output "-1". In addition, when trying to execute an action that passes over a wall, " Note that even if the action of the "action statement" is not performed, it is considered that the "action statement" has been executed (input example 1).

Examples

Input

5 3
###
#g#
#.#
#s#
###
^<^<vv


Output

5


Input

5 3

g#
.#
s#

^<^<vv


Output

5


Input

5 7

.#g..#
.###.#
s....#

{T{~C^}<}


Output

17


Input

5 7

.#g..#
.###.#
s....#

{T{~C^}>}


Output

-1

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
#define REP(i,n) for(int i=0;i<(n);++i)

using namespace std;

int main() {
  int h,w;
  cin>>h>>w;
  vector<string> b(h);
  using P = pair<int, int>;
  P s,g;
  REP(i,h) {
    cin>>b[i];
    REP(j,w) {
      if (b[i][j] == 's') {
        s = {i, j};
      } if (b[i][j] == 'g') {
        g = {i, j};
      }
    }
  }
  string prog;
  cin>>prog;
  int l = prog.size();
  vector<int> match(l);
  stack<int> beg;
  REP(i,l) {
    switch(prog[i]) {
      case '[':
      case '{':
        beg.push(i);
        break;
      case ']':
      case '}':
        match[i] = beg.top();
        match[beg.top()] = i;
        beg.pop();
        break;
      default:;
    }
  }
  using S = tuple<P, int, int>;
  set<S> his;
  P pos = s;
  int dir = 0;
  int ip = 0;
  int di[4] = {-1,0,1,0};
  int dj[4] = {0,1,0,-1};
  string dirc = "NESW";
  int cnt = 0;
  while (!his.count(S(pos, dir, ip))) {
    //cerr << pos.first << ' ' << pos.second << ' ' << dir << ' ' << ip << endl;
    if (pos == g) break;
    if (ip >= prog.size()) break;
    his.emplace(pos, dir, ip);
    switch (prog[ip]) {
      case '{':
      case '[': {
        bool inv = prog[ip+1] == '~';
        int condip = inv ? ip+2 : ip+1;
        bool res;
        switch (prog[condip]) {
          case 'N':
          case 'E':
          case 'S':
          case 'W':
            res = prog[condip] == dirc[dir];
            break;
          case 'C': {
            int i,j;
            tie(i, j) = pos;
            int ni = i+di[dir];
            int nj = j+dj[dir];
            res = b[ni][nj] == '#';
          } break;
          case 'T':
            res = true;
            break;
          default:;
        }
        if (inv) res = !res;
        if (res) {
          ip = condip+1;
        } else {
          ip = match[ip]+1;
        }
      } break;
      case ']':
        ++ip;
        break;
      case '}':
        ip = match[ip];
        break;
      case '^': {
        int i,j;
        tie(i, j) = pos;
        int ni = i+di[dir];
        int nj = j+dj[dir];
        if (b[ni][nj] != '#') {
          pos = P(ni, nj);
        }
        ++ip;
        ++cnt;
      } break;
      case 'v': {
        int i,j;
        tie(i, j) = pos;
        int ni = i+di[(dir+2)%4];
        int nj = j+dj[(dir+2)%4];
        if (b[ni][nj] != '#') {
          pos = P(ni, nj);
        }
        ++ip;
        ++cnt;
      } break;
      case '>':
        ++dir;
        dir %= 4;
        ++ip;
        ++cnt;
        break;
      case '<':
        dir += 3;
        dir %= 4;
        ++ip;
        ++cnt;
        break;
      default:
        cerr << "error" << endl;
    }
  }
  if (pos == g) {
    cout << cnt << endl;
  } else {
    cout << -1 << endl;
  }
  return 0;
}