codeforces -676D(Theseus and labyrinth)

#include <iostream>
#include <algorithm>
#include <cstring>
#include <cstdio>
#include <bitset>
#include <vector>
#include <queue>
#include <stack>
#include <cmath>
#include <list>
#include <set>
#include <map>
#define rep(i,a,b) for(int i = a;i <= b;++ i)
#define per(i,a,b) for(int i = a;i >= b;-- i)
#define mem(a,b) memset((a),(b),sizeof((a)))
#define FIN freopen("in.txt","r",stdin)
#define FOUT freopen("out.txt","w",stdout)
#define IO ios_base::sync_with_stdio(0),cin.tie(0)
#define mid ((l+r)>>1)
#define ls (id<<1)
#define rs ((id<<1)|1)
#define INF 0x3f3f3f3f
using namespace std;
typedef long long LL;
typedef pair<int, int> PIR;
const int N = 1e3+5;

int n, m, xs, ys, xe, ye, G[N][N], dir[4][2] = {0,-1,1,0,0,1,-1,0};
bool vis[N][N][10];
string s;
struct Node{
    int x, y, cnt, turn;
    Node (int _x, int _y, int _cnt, int _turn){
        x = _x; y = _y; cnt = _cnt; turn = _turn;
    }
};
inline int get(char c){
    if(c == '+')    return 15;
    if(c == '-')    return 5;
    if(c == '|')    return 10;
    if(c == '^')    return 8;
    if(c == '>')    return 4;
    if(c == '<')    return 1;
    if(c == 'v')    return 2;
    if(c == 'L')    return 14;
    if(c == 'R')    return 11;
    if(c == 'U')    return 7;
    if(c == 'D')    return 13;
    if(c == '*')    return 0;
}
bool judge(int x, int y, int stu){
    if(x < 1 || x > n || y < 1 || y > m || vis[x][y][stu] || !G[x][y])    return false;
    return true;
}
void bfs(){
    queue <Node> Q;
    mem(vis, false);
    Q.push(Node(xs, ys, 0, 0));
    vis[xs][ys][0] = true;
    while(!Q.empty()){
        Node h = Q.front();
        Q.pop();

        int xx = h.x, yy = h.y, cntt = h.cnt, turnn = h.turn;
        if(xx == xe && yy == ye){
            cout << cntt << endl;
            return ;
        }
        if(!vis[xx][yy][(turnn+1)%4]){
            Q.push(Node(xx, yy, cntt+1, (turnn+1)%4));
            vis[xx][yy][(turnn+1)%4] = true;
        } 
        rep(i, 0, 3){
            int xi = xx+dir[i][0], yi = yy+dir[i][1];
            if(judge(xi, yi, turnn) && (G[xx][yy]&(1<<(i+turnn)%4)) && (G[xi][yi]&(1<<(i+turnn+2)%4))){
                Q.push(Node(xi, yi, cntt+1, turnn));
                vis[xi][yi][turnn] = true;
            }
        }
    }
    cout << -1 << endl;
    return ;
}
int main()
{IO;
    cin >> n >> m;
    rep(i, 1, n){
        cin >> s;
        rep(j, 0, m-1)    G[i][j+1] = get(s[j]);
    }
    cin >> xs >> ys;
    cin >> xe >> ye;
    bfs();
    return 0;
}