CodeForces - 908B New Year and Buggy Bot （DFS）

Bob programmed a robot to navigate through a 2d maze.

The maze has some obstacles. Empty cells are denoted by the character '.', where obstacles are denoted by '#'.

There is a single robot in the maze. It's start position is denoted with the character 'S'. This position has no obstacle in it. There is also a single exit in the maze. It's position is denoted with the character 'E'. This position has no obstacle in it.

The robot can only move up, left, right, or down.

When Bob programmed the robot, he wrote down a string of digits consisting of the digits 0 to 3, inclusive. He intended for each digit to correspond to a distinct direction, and the robot would follow the directions in order to reach the exit. Unfortunately, he forgot to actually assign the directions to digits.

The robot will choose some random mapping of digits to distinct directions. The robot will map distinct digits to distinct directions. The robot will then follow the instructions according to the given string in order and chosen mapping. If an instruction would lead the robot to go off the edge of the maze or hit an obstacle, the robot will crash and break down. If the robot reaches the exit at any point, then the robot will stop following any further instructions.

Bob is having trouble debugging his robot, so he would like to determine the number of mappings of digits to directions that would lead the robot to the exit.

Input

The first line of input will contain two integers n and m (2 ≤ n, m ≤ 50), denoting the dimensions of the maze.

The next n lines will contain exactly m characters each, denoting the maze.

Each character of the maze will be '.', '#', 'S', or 'E'.

There will be exactly one 'S' and exactly one 'E' in the maze.

The last line will contain a single string s (1 ≤ |s| ≤ 100) — the instructions given to the robot. Each character of s is a digit from 0 to 3.

Output

Print a single integer, the number of mappings of digits to directions that will lead the robot to the exit.

Example

Input

5 6
.....#
S....#
.#....
.#....
...E..
333300012

Output

1

Input

6 6
......
......
..SE..
......
......
......
01232123212302123021

Output

14

Input

5 3
...
.S.
###
.E.
...
3

Output

0

Note

For the first sample, the only valid mapping is , where D is down, L is left, U is up, R is right.

题意：有一个机器人，按照所给的数字进行拐弯，数字只有0，1，2，3四个数字。但是这四个数字没有对照确定的方向，让你找有多少种可能的对照情况能使机器人从起点走到终点。

解题思路：我们可以枚举每个数字对应的方向的情况。递归边界是当四个数字都对应好方向时。拿着这次的对应关系按照所给的字符串的指示走，如果能走到终点则sum+1

AC代码：

#include<stdio.h>
#include<string.h>

char mp[55][55],s[110];
int a[4],book[4],x1,x2,y1,y2,sum,n,m,l;
int nx[]={0,1,0,-1};
int ny[]={1,0,-1,0};

void dfs(int cnt)
{
	if(cnt==4)
  	{
  		int tx=x1,ty=y1;
  		for(int i=0;i<l;i++) 
    	{
    		tx+=nx[a[s[i]-'0']];
			ty+=ny[a[s[i]-'0']];
    		if(tx<1||tx>n||ty<1||ty>m||mp[tx][ty]=='#') return;
    		if(tx==x2&&ty==y2) 
      		{
      			sum++;
				return;
      		}
    	}
  	}
	else
	{
		for(int i=0;i<4;i++)
		{
			if(book[i]==0)
  			{
  				a[cnt]=i;
				book[i]=1;
  				dfs(cnt+1);
  				book[i]=0;
  			}
		}
	}
		
}

int main()
{
	scanf("%d%d",&n,&m);
	for(int i=1;i<=n;i++) 
  	{
  		scanf("%s",mp[i]+1);
  		for(int j=1;j<=m;j++) 
    	{
    		if(mp[i][j]=='S') {x1=i;y1=j;}
    		else if(mp[i][j]=='E') {x2=i;y2=j;}
    	}  
  	}
	scanf("%s",s);
	l=strlen(s);
	sum=0;
	dfs(0);
	printf("%d",sum);
	return 0;
}