#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int n, m, a[35][35];
int dx[] = { -1, 1, 0, 0 }, dy[] = { 0, 0, -1, 1 };
char dc[] = "UDLR";
int sx, sy, ex, ey;
vector<int> ans;
void Mov(int x, int y, int d) {
	int k = 0;
	while (a[x - dx[d] * (k + 1)][y - dy[d] * (k + 1)] && a[ex + dx[d] * (k + 1)][ey + dy[d] * (k + 1)]) k++;
	if (a[ex + dx[d] * (k + 1)][ey + dy[d] * (k + 1)]) {
		for (int i = 1; i <= k + 1; i++) ans.push_back(d ^ 1);
		for (int i = 1; i <= k + 1; i++) ans.push_back(d);
	}
	else {
		for (int i = 1; i <= k; i++) ans.push_back(d ^ 1);
		for (int i = 1; i <= k + 1; i++) ans.push_back(d);
	}
}
bool vis[35][35];
pair<int, int> prt[35][35];
bool h[35][35];
void DFS1(int x, int y) {
	if (x == ex && y == ey) h[x][y] = true;
	vis[x][y] = true;
	for (int d = 0; d < 4; d++) {
		int nx = x + dx[d], ny = y + dy[d];
		if (vis[nx][ny] || !a[nx][ny]) continue;
		DFS1(nx, ny), prt[nx][ny] = { x, y };
		h[x][y] |= h[nx][ny];
	}
}
void DFS2(int x, int y) {
	vis[x][y] = true;
	for (int d = 0; d < 4; d++) {
		int nx = x + dx[d], ny = y + dy[d];
		if (vis[nx][ny] || !a[nx][ny]) continue;
		if (!h[nx][ny] && prt[nx][ny].first == x && prt[nx][ny].second == y) {
			Mov(x, y, d);
			DFS2(nx, ny);
			Mov(x, y, d ^ 1);
		}
	}
	for (int d = 0; d < 4; d++) {
		int nx = x + dx[d], ny = y + dy[d];
		if (vis[nx][ny] || !a[nx][ny]) continue;
		if (h[nx][ny] && prt[nx][ny].first == x && prt[nx][ny].second == y) {
			Mov(x, y, d);
			DFS2(nx, ny);
		}
	}
}
int main() {
	scanf("%d%d", &n, &m);
	for (int i = 1; i <= n; i++) {
		for (int j = 1; j <= m; j++) {
			scanf("%1d", &a[i][j]);
		}
	}
	scanf("%d%d%d%d", &sx, &sy, &ex, &ey);
	DFS1(sx, sy), memset(vis, 0, sizeof(vis)), DFS2(sx, sy);
	for (int i = 1; i <= n; i++) {
		for (int j = 1; j <= m; j++) {
			if (a[i][j] && !vis[i][j]) return puts("-1"), 0;
		}
	}
	for (int i : ans) putchar(dc[i]);
	reverse(ans.begin(), ans.end());
	for (int i : ans) putchar(dc[i]);
	putchar('\n');
	return 0;
}