#pragma GCC optimize("Ofast,no-stack-protector,unroll-loops")
// MagicDark
#include <bits/stdc++.h>
#define debug cerr << "[" << __LINE__ << "] "
#define SZ(x) (int) x.size() - 1
#define all(x) x.begin(), x.end()
#define ms(x, y) memset(x, y, sizeof x)
#define F(i, x, y) for (int i = (x); i <= (y); i++)
#define DF(i, x, y) for (int i = (x); i >= (y); i--)
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
template <typename T> inline void chkmax(T& x, T y) {x = max(x, y);}
template <typename T> inline void chkmin(T& x, T y) {x = min(x, y);}
template <typename T> inline void read(T &x) {
	x = 0; int f = 1; char c = getchar();
	for (; !isdigit(c); c = getchar()) if (c == '-') f = -f;
	for (; isdigit(c); c = getchar()) x = (x << 1) + (x << 3) + (c ^ 48);
	x *= f;
}
mt19937 mrand(1);//chrono::steady_clock::now().time_since_epoch().count());
inline int rnd(int l, int r) {return mrand() % (r - l + 1) + l;}
const int N = 35, lim = 5e5;
int n, m;
string st[N];
bool vis[N][N];
int ssx, ssy, ttx, tty;
int sx, sy, tx, ty, ss;
bool check() {
	return ss == 0 && (abs(sx - tx) + abs(sy - ty) <= 1);
}
vector <pair <array <int, 4>, char>> v[N][N][N][N];
char qq(int x) {
	if (x == 1) return 'L';
	if (x == 2) return 'R';
	if (x == 3) return 'U';
	return 'D';
}
signed main() {
	read(n), read(m);
	F(i, 1, n) {
		cin >> st[i];
		st[i] = ' ' + st[i];
		ss += count(all(st[i]), '1');
	}
	read(ssx), read(ssy), read(ttx), read(tty);
	F(sx, 1, n)
		F(sy, 1, m)
			F(tx, 1, n)
				F(ty, 1, m) {
					if (st[sx][sy] == '0' || st[tx][ty] == '0') continue;
					F(t, 1, 4) {//终点动
						int ssx, ssy, ttx, tty;
						if (t == 1) {
							ssx = sx, ttx = tx;
							ssy = max(1, sy - 1);
							if (ty == m) continue;
							tty = ty + 1;
						}
						if (t == 2) {
							ssx = sx, ttx = tx;
							ssy = min(m, sy + 1);
							if (ty == 1) continue;
							tty = ty - 1;
						}
						if (t == 3) {
							ssy = sy, tty = ty;
							ssx = max(1, sx - 1);
							if (tx == n) continue;
							ttx = tx + 1;
						}
						if (t == 4) {
							ssy = sy, tty = ty;
							ssx = min(n, sx + 1);
							if (tx == 1) continue;
							ttx = tx - 1;
						}
						if (st[ttx][tty] == '0') continue;
						if (st[ssx][ssy] == '0') ssx = sx, ssy = sy;
						v[sx][sy][tx][ty].emplace_back(array <int, 4> {ssx, ssy, ttx, tty}, qq(t));
					}
					F(t, 1, 4) {//终点不动
						int ssx, ssy;
						if (t == 1) {
							ssx = sx;
							ssy = max(1, sy - 1);
							if (!(ty == 1 || st[tx][ty - 1] == '0')) continue;
						}
						if (t == 2) {
							ssx = sx;
							ssy = min(m, sy + 1);
							if (!(ty == m || st[tx][ty + 1] == '0')) continue;
						}
						if (t == 3) {
							ssy = sy;
							ssx = max(1, sx - 1);
							if (!(tx == 1 || st[tx - 1][ty] == '0')) continue;
						}
						if (t == 4) {
							ssy = sy;
							ssx = min(n, sx + 1);
							if (!(tx == n || st[tx + 1][ty] == '0')) continue;
						}
						if (st[ssx][ssy] == '0') continue;
						v[sx][sy][tx][ty].emplace_back(array <int, 4> {ssx, ssy, tx, ty}, qq(t));
					}
				}
	if (check()) return 0;
	if (v[ssx][ssy][ttx][tty].empty()) {
		puts("-1");
		return 0;
	}
	ms(vis, false);
	sx = ssx, sy = ssy, tx = ttx, ty = tty;
	ss -= 2;
	if (sx == tx && sy == ty) ss++;
	vis[sx][sy] = vis[tx][ty] = true;
	string ans = "";
	F(i, 1, lim) {
		assert(v[sx][sy][tx][ty].size());
		int w = rnd(0, SZ(v[sx][sy][tx][ty]));
		ans += v[sx][sy][tx][ty][w].second;
		auto tmp = v[sx][sy][tx][ty][w].first;
		sx = tmp[0];
		sy = tmp[1];
		tx = tmp[2];
		ty = tmp[3];
		if (!vis[sx][sy]) ss--, vis[sx][sy] = true;
		if (!vis[tx][ty]) ss--, vis[tx][ty] = true;
		if (check()) {
			cout << ans;
			if (sx < tx) cout << 'D';
			if (sx > tx) cout << 'U';
			if (sy < ty) cout << 'R';
			if (sy > ty) cout << 'L';
			reverse(all(ans));
			cout << ans;
			return 0;
		}
	}
	puts("-1");
	return 0;
}
/* why?
*/