// includes
#include <bits/stdc++.h>

// macros
#define ll long long int
#define pb emplace_back
#define mk make_pair
#define pq priority_queue
#define FOR(i, a, b) for(int i=(a);i<(b);++i)
#define rep(i, n) FOR(i, 0, n)
#define rrep(i, n) for(int i=((int)(n)-1);i>=0;i--)
#define irep(st, itr) for(auto itr = (st).begin(); itr != (st).end(); ++itr)
#define vrep(v, i) for(int i = 0; i < (v).size(); i++)
#define all(x) (x).begin(),(x).end()
#define sz(x) ((int)(x).size())
#define UNIQUE(v) v.erase(unique(v.begin(), v.end()), v.end())
#define FI first
#define SE second
#define dump(a, n) for(int i = 0; i < n; i++)cout << a[i] << "\n "[i + 1 != n];
#define dump2(a, n, m) for(int i = 0; i < n; i++)for(int j = 0; j < m; j++)cout << a[i][j] << "\n "[j + 1 != m];
using namespace std;

//  types
typedef pair<int, int> P;
typedef pair<ll, int> Pl;
typedef pair<ll, ll> Pll;
typedef pair<double, double> Pd;
typedef complex<double> cd;
 
// constants
const int inf = 1e9;
const ll linf = 1LL << 50;
const double EPS = 1e-10;
const int mod = 1e9 + 7;

// solve
template <class T>bool chmax(T &a, const T &b){if(a < b){a = b; return 1;} return 0;}
template <class T>bool chmin(T &a, const T &b){if(a > b){a = b; return 1;} return 0;}
template <typename T> istream &operator>>(istream &is, vector<T> &vec){for(auto &v: vec)is >> v; return is;}
template <typename T> ostream &operator<<(ostream &os, const vector<T>& vec){for(int i = 0; i < vec.size(); i++){ os << vec[i]; if(i + 1 != vec.size())os << " ";} return os;}
template <typename T> ostream &operator<<(ostream &os, const set<T>& st){for(auto itr = st.begin(); itr != st.end(); ++itr){ os << *itr; auto titr = itr; if(++titr != st.end())os << " ";} return os;}
template <typename T> ostream &operator<<(ostream &os, const unordered_set<T>& st){for(auto itr = st.begin(); itr != st.end(); ++itr){ os << *itr; auto titr = itr; if(++titr != st.end())os << " ";} return os;}
template <typename T> ostream &operator<<(ostream &os, const multiset<T>& st){for(auto itr = st.begin(); itr != st.end(); ++itr){ os << *itr; auto titr = itr; if(++titr != st.end())os << " ";} return os;}
template <typename T> ostream &operator<<(ostream &os, const unordered_multiset<T>& st){for(auto itr = st.begin(); itr != st.end(); ++itr){ os << *itr; auto titr = itr; if(++titr != st.end())os << " ";} return os;}
template <typename T1, typename T2> ostream &operator<<(ostream &os, const pair<T1, T2> &p){os << p.first << " " << p.second; return os;}
template <typename T1, typename T2> ostream &operator<<(ostream &os, const map<T1, T2> &mp){for(auto itr = mp.begin(); itr != mp.end(); ++itr){ os << itr->first << ":" << itr->second; auto titr = itr; if(++titr != mp.end())os << " "; } return os;}
template <typename T1, typename T2> ostream &operator<<(ostream &os, const unordered_map<T1, T2> &mp){for(auto itr = mp.begin(); itr != mp.end(); ++itr){ os << itr->first << ":" << itr->second; auto titr = itr; if(++titr != mp.end())os << " "; } return os;}

template<typename T, typename E>
struct SegmentTree_ {
  function<T(T, T)> f;
  function<T(T, E)> g;
  int n;
  T def;
  vector<T> vec;
  SegmentTree_(){}
  SegmentTree_(int n_, function<T(T, T)> f_, function<T(T, E)> g_, T def_, vector<T> v=vector<T>()){
    f = f_;
    g = g_;
    def = def_;

    // initialize vector
    n = 1;
    while(n < n_){
      n *= 2;
    }
    vec = vector<T>(2*n -1, def);

    // initialize segment tree
    for(int i = 0; i < v.size(); i++){
      vec[i + n - 1] = v[i];
    }
    for(int i = n - 2; i >= 0; i--){
      vec[i] = f(vec[2*i+1], vec[2*i+2]);
    }
  }
  void update(int k, E val){
    k = k + n - 1;
    vec[k] = g(vec[k], val);
    while(k > 0){
      k = (k - 1) / 2;
      vec[k] = f(vec[2*k+1], vec[2*k+2]);
    }
  }
  // [l, r) -> [a, b) (at k)
  T query(int a, int b, int k, int l, int r){
    if(r <= a || b <= l)return def;
    if(a <= l && r <= b)return vec[k];
    T ld = query(a, b, 2*k+1, l, (l+r)/2);
    T rd = query(a, b, 2*k+2, (l+r)/2, r);
    return f(ld, rd);
  }
  T query(int a, int b){
    return query(a, b, 0, 0, n);
  }
};

template<typename T, typename E>
using SegmentTree = struct SegmentTree_<T, E>;
using SegmentTreeI = SegmentTree<int, int>;

int lt[200001], rt[200001];
int la[200001], ra[200001];
int ut[200001], ua[200001];
int dt[200001], da[200001];

int main(int argc, char const* argv[])
{
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  int h, w, n;
  cin >> h >> w >> n;
  int sr, sc;
  cin >> sr >> sc, sr--, sc--;
  string s, t;
  cin >> s >> t;
  SegmentTreeI seg = SegmentTreeI(n, [](int a, int b){return max(a, b);},
      [](int a,int b){return b;}, 0, vector<int>());
  rep(i, n){
    if(i > 0){
      rt[i] = rt[i-1];
      lt[i] = lt[i-1];
      ut[i] = ut[i-1];
      dt[i] = dt[i-1];
    }
    if(s[i] == 'L')lt[i]++;
    if(s[i] == 'R')rt[i]++;
    if(s[i] == 'U')ut[i]++;
    if(s[i] == 'D')dt[i]++;
    if(i > 0){
      ra[i] = ra[i-1];
      la[i] = la[i-1];
      ua[i] = ua[i-1];
      da[i] = da[i-1];
    }
    if(t[i] == 'L')la[i]++;
    if(t[i] == 'R')ra[i]++;
    if(t[i] == 'U')ua[i]++;
    if(t[i] == 'D')da[i]++;
    seg.update(i, lt[i] - ra[i]);
  }
  int curr = sc;
  rep(i, n){
    if(s[i] == 'R')curr++;
    if(curr >= w){
      cout << "NO" << endl;
      return 0;
    }
    if(t[i] == 'L' && curr - 1 - seg.query(i+1, n) >= 0)curr--;
  }
  rep(i, n)seg.update(i, rt[i] - la[i]);
  curr = sc;
  rep(i, n){
    if(s[i] == 'L')curr--;
    if(curr < 0){
      cout << "NO" << endl;
      return 0;
    }
    if(t[i] == 'R' && curr + 1 + seg.query(i+1, n) < w)curr++;
  }
  rep(i, n)seg.update(i, ut[i] - da[i]);
  curr = sr;
  rep(i, n){
    if(s[i] == 'D')curr++;
    if(curr >= h){
      cout << "NO" << endl;
      return 0;
    }
    if(t[i] == 'U' && curr - 1 - seg.query(i+1, n) >= 0)curr--;
  }
  rep(i, n)seg.update(i, dt[i] - ua[i]);
  curr = sr;
  rep(i, n){
    if(s[i] == 'U')curr--;
    if(curr < 0){
      cout << "NO" << endl;
      return 0;
    }
    if(t[i] == 'D' && curr + 1 + seg.query(i+1, n) < h)curr++;
  }

  cout << "YES" << endl;
  return 0;
}


Measured memory_bytes: 9240