#include<bits/stdc++.h>
#define L(i, j, k) for(int i = (j); i <= (k); ++i)
#define R(i, j, k) for(int i = (j); i >= (k); --i)
#define ll long long
#define vi vector <int>
#define sz(a) ((int) (a).size())
#define me(f, x) memset(f, x, sizeof(f))
#define uint unsig7ned int
#define ull unsigned long long 
#define i128 __int128
using namespace std;
const int N = 1007;
int n, m, k;
vi e[N][4], re[N][4];
char s[N][N];
int dt[N][4] = {{1, 0}, {-1, 0}, {0, 1}, {0, -1}};
string S = "DURL";
int vis[N][N], lstv[N][N];
pair < int, int > lst[N][N];
int tot, id[N][N], kan[N];

mt19937_64 orz;
int main() {
	ios :: sync_with_stdio(false);
	cin.tie(0); cout.tie(0);
	cin >> n >> m;
	L(i, 1, n) {
		string S;
		cin >> S;
		L(j, 0, m - 1) {
			s[i][j + 1] = S[j];
		}
	}
	L(i, 1, n) {
		L(j, 1, m) {
			if(s[i][j] == '1') {
				id[i][j] = ++tot;
			}
		}
	}
	L(i, 1, n) {
		L(j, 1, m) if(id[i][j]) {
			L(d, 0, 3) {
				int ni = i + dt[d][0];
				int nj = j + dt[d][1];
				int to = id[ni][nj];
				if(!to) {
					to = id[i][j];
				}
				e[id[i][j]][d].emplace_back(to);
				re[to][d].emplace_back(id[i][j]);
			}
		}
	}
	int sx, sy, tx, ty;
	cin >> sx >> sy >> tx >> ty;
	int S = id[sx][sy];
	int T = id[tx][ty];
	
	const int blk = 4.5e5;
	vector < pair < int, int > > going;
	string sl;
	L(t, 1, blk) {
//		cerr << S << ' ' << T << endl;
		int ban = 0;
		vector < pair < int, pair < int, int > > > edges;
//		cout << "ok\n";
//		L(d, 0, 3) 
//			cout << sz(e[S][d]) << ' ' << sz(re[T][d]) << "\n";
//		cout << endl;
		
		L(d, 0, 3) {
			for(auto&a : e[S][d]) if(!ban) {
				for(auto&b : re[T][d]) if(!ban) {
					if(!kan[a] || !kan[b]) {
						sl += ::S[d];
						S = a;
						T = b;
						ban = 1;
						break;
					} else {
						edges.emplace_back(make_pair(d, make_pair(a, b)));
					}
				}
			}
		}
		if(!ban) {
			auto qwq = edges[orz() % sz(edges)];
			sl += ::S[qwq.first];
			S = qwq.second.first;
			T = qwq.second.second;
		}
		kan[S] = kan[T] = 1;	
	}
	
	queue < pair < int, int > > que;
	que.push({S, T});
	vis[S][T] = 1;
	int ans = -1;
	while(!que.empty()) {
		auto pr = que.front();
		que.pop();
		int x = pr.first;
		int y = pr.second;
		if(x == y) {
			ans = x;
			break;
		}
		L(d, 0, 3) {
			for(auto&a : e[x][d]) {
				for(auto&b : re[y][d]) {
					if(!vis[a][b]) {
						vis[a][b] = 1;
						lst[a][b] = make_pair(x, y);
						lstv[a][b] = d;
						que.push({a, b}); 
					}
				}
			}
		}
	}
	L(i, 1, tot) 
		if(!kan[i]) {
			cout << "-1\n"; 
			exit(0);
		}
	if(ans == -1) {
		cout << "-1\n"; 
		exit(0);
	}
	int s = ans, t = ans;
	string qwq;
	while(s != S || t != T) {
		qwq += ::S[lstv[s][t]];
		auto pr = lst[s][t];
		s = pr.first;
		t = pr.second;
	}
	reverse(qwq.begin(), qwq.end());
	sl += qwq;
	
	string sr = sl;
	reverse(sr.begin(), sr.end());
	sl += sr;
	cout << sl << '\n';
	return 0;
}