#include <algorithm>
#include <bitset>
#include <cmath>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <regex>
#include <set>
#include <stack>
#include <string>
#include <vector>

const int MOD = 1e9 + 7;
const int iINF = 1000000000;
const long long int llINF = 1000000000000000000;

using namespace std;
using ll = long long int;
using vl = vector<ll>;
using vvl = vector<vector<ll>>;
using vvvl = vector<vector<vector<ll>>>;

typedef pair<ll, ll> pll;
bool paircomp(const pll &a, const pll &b) {
  if (a.first == b.first)
    return a.second < b.second;
  return a.first < b.first;
}
struct multi {
  ll first;
  ll second;
  ll third;
};
bool multicomp(const multi &a, const multi &b) {
  if (a.first == b.first)
    return a.second < b.second;
  return a.first < b.first;
}
#define REP(i, n) for (ll i = 0; i < (n); i++)
#define RREP(i, n) for (ll i = (n)-1; i >= 0; i--)
#define FOR(i, a, b) for (ll i = (a); i < (b); i++)
#define AUTO(i, m) for (auto &i : m)
#define ALL(a) (a).begin(), (a).end()
#define MAX(vec) *std::max_element(vec.begin(), vec.end())
#define MIN(vec) *std::min_element(vec.begin(), vec.end())
#define ARGMAX(vec)                                                            \
  std::distance(vec.begin(), std::max_element(vec.begin(), vec.end()))
#define ARGMIN(vec)                                                            \
  std::distance(vec.begin(), std::min_element(vec.begin(), vec.end()))
#define REV(T) greater<T>()
#define PQ(T) priority_queue<T, vector<T>, greater<T>>
#define VVL(a, b, c) vector<vector<ll>>(a, vector<ll>(b, c))
#define VVVL(a, b, c, d)                                                       \
  vector<vector<vector<ll>>>(a, vector<vector<ll>>(b, vector<ll>(c, d)))
#define SP(a) setprecision(a)
#define SQRT(a) sqrt((long double)(a))
#define DPOW(a, b) pow((long double)(a), (long double)(b))
#define UNIQUE(vec)                                                            \
  do {                                                                         \
    sort(ALL((vec)));                                                          \
    (vec).erase(std::unique(ALL((vec))), (vec).end());                         \
  } while (0)

ll POW(ll n, ll m) {
  if (m == 0) {
    return 1;
  } else if (m % 2 == 0) {
    ll tmp = POW(n, m / 2);
    return (tmp * tmp);
  } else {
    return (n * POW(n, m - 1));
  }
}

int dx[4] = {1, 0, -1, 0};
int dy[4] = {0, 1, 0, -1};

int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  ll H, W, N, sr, sc;
  cin >> H >> W >> N;
  cin >> sr >> sc;
  string S, T;
  cin >> S >> T;

  deque<ll> vkouho;
  REP(i, H) vkouho.push_back(i + 1);
  RREP(i, N) {
    if (T[i] == 'U' && vkouho.back() != H)
      vkouho.push_back(vkouho.back() + 1);
    if (T[i] == 'D' && vkouho.front() != 1)
      vkouho.push_front(vkouho.front() - 1);
    if (S[i] == 'U')
      vkouho.pop_front();
    if (S[i] == 'D')
      vkouho.pop_back();
    if ((S[i] == 'U' || S[i] == 'D') && vkouho.size() == 0) {
      cout << "NO" << endl;
      return 0;
    }
  }
  if (find(ALL(vkouho), sr) == vkouho.end()) {
    cout << "NO" << endl;
    return 0;
  }
  deque<ll> wkouho;
  REP(i, W) wkouho.push_back(i + 1);

  RREP(i, N) {
    if (T[i] == 'L' && wkouho.back() != W)
      wkouho.push_back(wkouho.back() + 1);
    if (T[i] == 'R' && wkouho.front() != 1)
      wkouho.push_front(wkouho.front() - 1);
    if (S[i] == 'L')
      wkouho.pop_front();
    if (S[i] == 'R')
      wkouho.pop_back();
    if ((S[i] == 'L' || S[i] == 'R') && wkouho.size() == 0) {
      cout << "NO" << endl;
      return 0;
    }
  }
  if (find(ALL(wkouho), sc) == wkouho.end()) {
    cout << "NO" << endl;
    return 0;
  }
  cout << "YES" << endl;

  return 0;
}


Measured memory_bytes: 3836