// includes
#include <bits/stdc++.h>
using namespace std;

// macros
#define pb emplace_back
#define mk make_pair
#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(itr, st) for(auto itr = (st).begin(); itr != (st).end(); ++itr)
#define irrep(itr, st) for(auto itr = (st).rbegin(); itr != (st).rend(); ++itr)
#define whole(x) (x).begin(),(x).end()
#define sz(x) ((int)(x).size())
#define bit(n) (1LL<<(n))
#define F first
#define S second
// functions
template <typename T> void unique(T& c){c.erase(std::unique(c.begin(), c.end()), c.end());}
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;}
//  types
using ll = long long int;
using P = pair<int, int>;
// constants
const int inf = 1e9;
const ll linf = 1LL << 60;
const double EPS = 1e-10;
const int mod = 1000000007;
const int dx[4] = {-1, 0, 1, 0};
const int dy[4] = {0, -1, 0, 1};
// io
struct fast_io{
  fast_io(){ios_base::sync_with_stdio(false); cin.tie(nullptr); cout << fixed << setprecision(20);}
} fast_io_;

bool solve(int s, int h, vector<int> &vs, vector<int> &vt){
  //cerr << s << " " << h << endl;
  //cerr << vs << endl;
  //cerr << vt << endl;
  int n = sz(vs);
  int l = 0, r = h + 1;
  for(int i = n - 1; i >= 0; i--){
    if(i < n - 1){
      // a
      if(vt[i] == 1){
        l = max(0, l - 1);
      }else if(vt[i] == -1){
        r = min(h + 1, r + 1);
      }
    }
    if(r <= l + 1)return false;
    // t
    if(vs[i] == 1){
      r = max(r - 1, 0);
    }else if(vs[i] == -1){
      l = min(h + 1, l + 1);
    }
    //cerr << l << " " << r << endl;
    if(r <= l + 1)return false;
  }
  if(!(s <= l || r <= s))return true;
  return false;
}

int main(int argc, char const* argv[])
{
  int h, w, n; cin >> h >> w >> n;
  int sr, sc; cin >> sr >> sc;
  string s, t; cin >> s >> t;
  vector<int> vrs(n, 0), vcs(n, 0), vrt(n, 0), vct(n, 0);
  rep(i, n){
    if(s[i] == 'L')vcs[i] = -1;
    else if(s[i] == 'R')vcs[i] = 1;
    else if(s[i] == 'U')vrs[i] = -1;
    else if(s[i] == 'D')vrs[i] = 1;
    if(t[i] == 'L')vct[i] = -1;
    else if(t[i] == 'R')vct[i] = 1;
    else if(t[i] == 'U')vrt[i] = -1;
    else if(t[i] == 'D')vrt[i] = 1;
  }
  bool res = solve(sr, h, vrs, vrt);
  res &= solve(sc, w, vcs, vct);
  //cerr << solve(sr, h, vrs, vrt) << endl;
  //cerr << solve(sc, w, vcs, vct) << endl;
  cout << (res ? "YES": "NO") << endl;
  return 0;
}


Measured memory_bytes: 3992