Good Bye 2017 B - New Year and Buggy Bot

#include<iostream>
#include<algorithm>
#include<iomanip>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<string>
#include<cmath>
#include<set>
#include<queue>
#include<stack>
#include<map>
#define PI acos(-1.0)
#define in freopen("in.txt", "r", stdin)
#define out freopen("out.txt", "w", stdout)
#define kuaidian ios::sync_with_stdio(0);

using namespace std;
typedef long long ll;
typedef unsigned long long ull;
const int maxn = 50 + 7, maxd = 1e5 + 7;

const ll mod = 1e9 + 7;
const int INF = 0x7f7f7f7f;

int n, m;
char s[maxn][maxn];
string t;
int i, j, k, x, ii, jj, ii_, jj_;

bool solve() {
    for(int c = 0; c < t.length(); ++c) {
        if(t[c]-'0' == i) {
            ii--;
        }
        if(t[c]-'0' == j) {
            ii++;
        }
        if(t[c]-'0' == k) {
            jj--;
        }
        if(t[c]-'0' == x) {
            jj++;
        }

        if(ii < 1 || ii > n || jj < 1 || jj > m) {
            return false;
        }

        if(s[ii][jj] == '#') return false;
        if(s[ii][jj] == 'E'){
            return true;
        }

    }
    return false;
}

int main() {
    kuaidian;

    cin >> n >> m;
    for(int i = 1; i <= n; ++i) {
        for(int j = 1; j <= m; ++j) {
            cin >> s[i][j];
            if(s[i][j] == 'S') {
                ii_ = i;
                jj_ = j;
            }
        }
    }
    
    cin >> t;
    
    int ans = 0;
    for( i = 0; i < 4; ++i) {
        for( j = 0; j < 4; ++j) {
            if(i == j) continue;
            for( k = 0; k < 4; ++k) {
                if(i == k || j == k) continue;
                for( x = 0; x < 4; ++x) {
                    if(i == x || j == x || k == x) {
                        continue;
                    }

                    ii = ii_;
                    jj = jj_;
                    if(solve()) ans++;

                }
            }
        }
    }

    cout << ans << endl;

    return 0;
}