CodeForces - 908B New Year and Buggy Bot

B. New Year and Buggy Bot

time limit per test

1 second

memory limit per test

256 megabytes

input

standard input

output

standard output

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. Its start position is denoted with the character 'S'. This position has no obstacle in it. There is also a single exit in the maze. Its 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.

Examples

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.

题意：有一张n*m的地图，机器人从S出发要前往E，在行走过程中只要撞墙或者出地图就算作失败，到达终点时就停止行动，给定了机器人的每次行走的编号（0，1，2，3四个数字分别对应一个编号），但没有确切规定编号对应的方向，问共有多少种对应方式能使得机器人可以走到终点

思路：运用next_permutation函数会简化很多

遍历所有对应情况，模拟机器人的行动判断即可

tran数组是将编号与方向对应

#include <iostream>
#include <cstdio>
#include <cmath>
#include <vector>
#include <stack>
#include <cstring>
#include <queue>
#include <algorithm>
#define ll long long
#define max_ 100100
#define les 1e-6
#define inf 0x3f3f3f3f
using namespace std;

int m,n;
char mp[60][60];
int tran[4]={0,1,2,3};
int dir[4][2]={1,0,-1,0,0,1,0,-1};
int num[200],sx,sy;
int main(int argc, char const *argv[]) {
    scanf("%d%d",&n,&m);
    for(int i=1;i<=n;i++)
    {
        for(int j=1;j<=m;j++)
        {
            scanf(" %c",&mp[i][j]);
            if(mp[i][j]=='S')
            {
                sx=i;
                sy=j;
            }
        }
    }
    string s;
    cin>>s;
    int ans=0;
    do
    {
        int x=sx;
        int y=sy;
        for(int i=0;i<s.size();i++)
        {
            int d=s[i]-'0';
            x+=dir[tran[d]][0];
            y+=dir[tran[d]][1];
            if(x<1||y<1||x>n||y>m)
            break;
            if(mp[x][y]=='#')
            break;
            if(mp[x][y]=='E')
            {
                ans++;
                break;
            }
        }
    }while(next_permutation(tran,tran+4));
    printf("%d\n",ans );
    return 0;
}