import std.stdio, std.conv, std.functional, std.string;
import std.algorithm, std.array, std.container, std.range, std.typecons;
import std.numeric, std.math, std.random;
import core.bitop;

string FMT_F = "%.10f";

static string[] s_rd;
T RD(T = long)() { while(!s_rd.length) s_rd = readln.chomp.split; string res = s_rd[0]; s_rd.popFront; return res.to!T; }
string RDR()() { return readln.chomp; }
T[] ARR(T = long)(in string str, T fix = 0) { auto r = str.split.to!(T[]); r[] += fix; return r; }
size_t[] MAKE_IDX(alias less = "a < b", Range)(Range range) { auto idx = new size_t[](range.length); makeIndex!(less)(range, idx); return idx;}
size_t MIN_POS(alias less = "a < b", Range)(Range range) { auto r = minPos!(less)(range); return range.length - r.length; }

bool inside(T)(T x, T b, T e) { return x >= b && x < e; }
bool minimize(T)(ref T x, T y) { if (x > y) { x = y; return true; } else { return false; } }
bool maximize(T)(ref T x, T y) { if (x < y) { x = y; return true; } else { return false; } }
long lcm(long x, long y) { return x * y / gcd(x, y); }

long mod = 10^^9 + 7;
void moda(ref long x, long y) { x = (x + y) % mod; }
void mods(ref long x, long y) { x = ((x + mod) - (y % mod)) % mod; }
void modm(ref long x, long y) { x = (x * y) % mod; }

void main()
{
	auto H = RD;
	auto W = RD;
	auto N = RD;
	auto sr = RD;
	auto sc = RD;
	auto S = RD!string;
	auto T = RD!string;

	long[char] nums1, nums2;
	nums1['L'] = 0;
	nums1['R'] = 1;
	nums1['U'] = 2;
	nums1['D'] = 3;
	nums2['L'] = 1;
	nums2['R'] = 0;
	nums2['U'] = 3;
	nums2['D'] = 2;
	auto limit = [sc, W-sc+1, sr, H-sr+1];
	auto best = new long[4][](N+1);
	foreach_reverse (i; 0..N)
	{
		auto n1 = nums1[S[i]];
		auto n2 = nums2[T[i]];

		--best[i+1][n2];
		if (-best[i+1][n2] + max(0, best[i+1][n1]) >= limit[n1])
			++best[i+1][n2];

		best[i][] = best[i+1][];

		++best[i][n1];
	}

	bool ans = true;
	foreach (i; 0..N)
	{
		if (best[i][0] >= sc)
		{
			ans = false;
			break;
		}
		else if (best[i][1] > W - sc)
		{
			ans = false;
			break;
		}
		else if (best[i][2] >= sr)
		{
			ans = false;
			break;
		}
		else if (best[i][3] > H - sr)
		{
			ans = false;
			break;
		}
	}
	debug writeln(best);

	writeln(ans ? "YES" : "NO");
	stdout.flush();
	debug readln();
}