#include <bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef pair<LL, LL> PII;

// chmax, chmin
template <class T>
inline bool chmax(T& a, T b) {
  if (a < b) {
    a = b;
    return 1;
  }
  return 0;
}
template <class T>
inline bool chmin(T& a, T b) {
  if (a > b) {
    a = b;
    return 1;
  }
  return 0;
}

template <typename T>
function<T(T, T)> op_max = [](T a, T b) -> T { return max(a, b); };
template <typename T>
function<T(T, T)> op_min = [](T a, T b) -> T { return min(a, b); };

template <typename T>
function<T(T, T)> op_sum = [](T a, T b) -> T { return a + b; };

namespace detail {
template <typename T, std::size_t NDIMS>
struct vector_builder {
  using type = std::vector<typename vector_builder<T, NDIMS - 1>::type>;

  static type make(std::vector<std::size_t> dims, const T& v = {}) {
    const auto vec = std::vector<T>(dims.empty() ? 0 : dims.back(), v);
    if (!dims.empty()) dims.pop_back();
    return vector_builder<std::vector<T>, NDIMS - 1>::make(dims, vec);
  }
};

template <typename T>
struct vector_builder<T, 1> {
  using type = std::vector<T>;

  static type make(std::vector<std::size_t> dims, const T& v = {}) {
    return type(dims.empty() ? 0 : dims.back(), v);
  }
};
}  // namespace detail

template <typename T, typename... SIZE_T>
auto exvector(const T& v, SIZE_T... dims) {
  static_assert(sizeof...(dims) != 0, "invalid dimension");
  std::vector<std::size_t> vec_dims{dims...};
  return detail::vector_builder<T, sizeof...(dims)>::make(vec_dims, v);
}

using namespace std;
//********************  dumps ************************//

template <typename T>
void dump(const T& data, vector<int>& iter) {
  cout << data << " ";
}
template <typename T>
void dump(const vector<T>& data, vector<int>& iter) {
  for (auto elem : data) dump(elem, iter);
  cout << endl;
}

template <typename T>
void dump(const vector<vector<T>>& data, vector<int>& iter) {
  for (auto elem : iter) {
    cout << "[" << elem << "]";
  }
  cout << endl;
  for (int i = 0; i < data.size(); i++) {
    iter.push_back(i);
    dump(data[i], iter);
    iter.pop_back();
  }
  cout << endl;
}

template <typename T>
void dump(const vector<T>& data, int dummy) {
  for (int i = 0; i < data.size(); i++) {
    cout << "[" << i << "] " << data[i] << endl;
  }
}
template <typename T>
void dump(const T& data) {  // T : data, U = base type val.
  vector<int> iter;
  dump(data, iter);
}
///////////////////////////////////////////////

const string YES = "YES";
const string NO = "NO";

void solve(long long H, long long W, long long N, long long s_r, long long s_c,
           std::string S, std::string T) {
  int u = 0, r = 0, l = 0, d = 0;

  for (int i = N - 1; i >= 0; i--) {
    if (T[i] == 'U') d = max(0, d - 1);
    if (T[i] == 'R') l = max(0, l - 1);
    if (T[i] == 'L') r = max(0, r - 1);
    if (T[i] == 'D') u = max(0, u - 1);

    if (S[i] == 'U') u++;
    if (S[i] == 'R') r++;
    if (S[i] == 'L') l++;
    if (S[i] == 'D') d++;
    if (u + d >= H || r + l >= W) {
      cout << NO << endl;
      return;
    }
  }
  if (l >= s_c) {
    cout << NO << endl;
    return;
  }

  if (r >= W + 1 - s_c) {
    cout << NO << endl;
    return;
  }
  if (d >= H + 1 - s_r) {
    cout << NO << endl;
    return;
  }

  if (u >= s_r) {
    cout << NO << endl;
    return;
  }
  cout << YES << endl;
}

int main() {
  cout << setprecision(10);
  long long H;
  scanf("%lld", &H);
  long long W;
  scanf("%lld", &W);
  long long N;
  scanf("%lld", &N);
  long long s_r;
  scanf("%lld", &s_r);
  long long s_c;
  scanf("%lld", &s_c);
  std::string S;
  std::cin >> S;
  std::string T;
  std::cin >> T;
  solve(H, W, N, s_r, s_c, S, T);
  return 0;
}


Measured memory_bytes: 1160