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

class EOFException : Throwable { this() { super("EOF"); } }
string[] tokens;
string readToken() { for (; tokens.empty; ) { if (stdin.eof) { throw new EOFException; } tokens = readln.split; } auto token = tokens.front; tokens.popFront; return token; }
int readInt() { return readToken.to!int; }
long readLong() { return readToken.to!long; }
real readReal() { return readToken.to!real; }

bool chmin(T)(ref T t, in T f) { if (t > f) { t = f; return true; } else { return false; } }
bool chmax(T)(ref T t, in T f) { if (t < f) { t = f; return true; } else { return false; } }

int binarySearch(alias pred, T)(in T[] as) { int lo = -1, hi = cast(int)(as.length); for (; lo + 1 < hi; ) { const mid = (lo + hi) >> 1; (unaryFun!pred(as[mid]) ? hi : lo) = mid; } return hi; }
int lowerBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a >= val)); }
int upperBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a > val)); }


bool solve(int L, int N, int R, in string S, in string T, char plus, char minus) {
  int a = 1, b = L;
  foreach_reverse (i; 0 .. N) {
    if (T[i] == plus) {
      if (a > 1) {
        --a;
      }
    } else if (T[i] == minus) {
      if (b < L) {
        ++b;
      }
    }
    if (S[i] == plus) {
      --b;
    } else if (S[i] == minus) {
      ++a;
    }
    
    if (a > b) {
      return false;
    }
  }
  return (a <= R && R <= b);
}

void main() {
  try {
    for (; ; ) {
      const H = readInt();
      const W = readInt();
      const N = readInt();
      const RX = readInt();
      const RY = readInt();
      const S = readToken();
      const T = readToken();
      
      const resX = solve(H, N, RX, S, T, 'D', 'U');
      const resY = solve(W, N, RY, S, T, 'R', 'L');
      writeln((resX && resY) ? "YES" : "NO");
    }
  } catch (EOFException e) {
  }
}
