#include <algorithm>
#include <cassert>
#include <cfloat>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <deque>
#include <iostream>
#include <iterator>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>

#define FOR(i,k,n) for(int(i)=(k);(i)<(n);++(i))
#define rep(i,n) FOR(i,0,n)
#define all(v) begin(v),end(v)
#define debug(x) //std::cerr<<#x<<": "<<x<<"\n"
#define debug2(x,y) //std::cerr<<#x<<": "<<x<<", "<<#y<<": "<<y<<"\n"
#define debug3(x,y,z) //std::cerr<<#x<<": "<<x<<", "<<#y<<": "<<y<<", "<<#z<<": "<<z<<"\n"

using ll=long long;
using vi=std::vector<int>;
using vvi=std::vector<vi>;
using vll=std::vector<ll>;
using vvll=std::vector<vll>;
template<typename T> using vvec=std::vector<std::vector<T>>;
template<typename T>
auto make_v(size_t sz){return std::vector<T>(sz);}
template<typename T,typename... Ts>
auto make_v(size_t sz,Ts...ts){return std::vector<decltype(make_v<T>(ts...))>(sz,make_v<T>(ts...));}
template<typename T>
void fill_v(T&var,const T&x){var=x;}
template<typename V,typename T>
void fill_v(V&v,const T&x){for(auto&& w:v){fill_v(w,x);}}

template<typename T> std::ostream& operator<<(std::ostream&s,const std::vector<T>&v){
  int sz=v.size();s<<"\n";rep(i,sz){s<<v[i];if(i<sz-1){s<<"\t";}}s<<"\n";return s;}
template<typename T> std::ostream& operator<<(std::ostream&s,const std::vector<std::vector<T>>&v){
  for(auto&& w:v){s<<w;}return s;}
template<typename T> std::ostream& operator<<(std::ostream&s,const std::deque<T>&v){
  int sz=v.size();s<<"\n";rep(i,sz){s<<v[i];if(i<sz-1){s<<"\t";}}s<<"\n";return s;}
template<typename T> std::ostream& operator<<(std::ostream&s,const std::deque<std::deque<T>>&v){
  for(auto&& w:v){s<<w;}return s;}
template<typename T> std::ostream& operator<<(std::ostream&s, const std::set<T>&v){
  s<<"\n";for(auto&& elm:v){s<<elm<<"\t";}s<<"\n";return s;}

inline void scan(int&a){scanf("%d",&a);}
inline void scan(ll&a){scanf("%lld",&a);}
inline void scan(char&a){scanf(" %c",&a);}
inline void scan(double&a){scanf("%lf",&a);}
inline void scan(std::string&s){char BUF[3000000];scanf(" %s",BUF);s=std::string(BUF);}
template<typename T>
inline void scan(std::vector<T>&v){for(auto&& sv:v){scan(sv);}}
template<typename First,typename...Args>
inline void scan(First&f,Args&...args){scan(f);scan(args...);}
inline void print(int a){printf("%d\n",a);}
inline void print(ll a){printf("%lld\n",a);}
inline void print(double a){printf("%.12f\n",a);}
inline void print(std::string s){std::cout<<s<<"\n";}

using namespace std;

int main() {
  int h, w, n;
  scan(h, w, n);
  int sr, sc;
  scan(sr, sc);
  string s, t;
  scan(s);
  scan(t);
  vi margin = { sc - 1, w - sc, sr - 1, h - sr };
  debug(margin);
  string saim = "LRUD";
  string taim = "RLDU";
  int left = 0;
  int right = w;
  int top = 0;
  int bottom = h;

  if (s[n-1] == 'L') {
    left += 1;
  } else if (s[n-1] == 'R') {
    right -= 1;
  } else if (s[n-1] == 'U') {
    top += 1;
  } else {
    bottom -= 1;
  }
  if (left == right || top == bottom) {
    print("NO");
    return 0;
  }
  debug2(left, right);
  debug2(top, bottom);
  for (int i = n-2; i >= 0; --i) {
    if (t[i] == 'L') {
      right = min(w, right + 1);
    } else if (t[i] == 'R') {
      left = max(0, left - 1);
    } else if (t[i] == 'U') {
      bottom = min(h, bottom + 1);
    } else {
      top = max(0, top - 1);
    }
    if (s[i] == 'L') {
      left += 1;
    } else if (s[i] == 'R') {
      right -= 1;
    } else if (s[i] == 'U') {
      top += 1;
    } else {
      bottom -= 1;
    }
    if (left == right || top == bottom) {
      print("NO");
      return 0;
    }
  debug2(left, right);
  debug2(top, bottom);
  }
  if (top < sr && sr <= bottom && left < sc && sc <= right) {
    print("YES");
  } else {
    print("NO");
  }

  return 0;
}


Measured memory_bytes: 2816