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

#define NDEBUG
#include <cassert>


typedef long long ll;
typedef long double Double;
typedef unsigned long long ull;
typedef pair<int,int> ii;
typedef pair<ll,ll> llll;
typedef pair<double,double> dd;

typedef vector<int> vi;
typedef vector<vector<int>> vvi;
typedef vector<ii> vii;
typedef vector<vector<ii>> vvii;
typedef vector<ll> vll;
typedef vector<vector<ll>> vvll;
typedef vector<llll> vllll;
typedef vector<bool> vb;
typedef vector<string> vs;
typedef vector<double> vd;
typedef vector<long double> vD;

#define sz(a)  int((a).size())
#define pb  push_back
#define eb  emplace_back
#define FOR(var,from,to) for(int var=(from);var<=(to);++var)
#define rep(var,n)  for(int var=0;var<(n);++var)
#define rep1(var,n)  for(int var=1;var<=(n);++var)
#define repC2(vari,varj,n)  for(int vari=0;vari<(n)-1;++vari)for(int varj=vari+1;varj<(n);++varj)
#define repC3(vari,varj,vark,n)  for(int vari=0;vari<(n)-2;++vari)for(int varj=vari+1;varj<(n)-1;++varj)for(int vark=varj+1;vark<(n);++vark)
#define ALL(c)  (c).begin(),(c).end()
#define RALL(c)  (c).rbegin(),(c).rend()
#define tr(i,c)  for(auto i=(c).begin(); i!=(c).end(); ++i)
#define mset(arr,val)  memset(arr,val,sizeof(arr))
#define mid(x,y) ((x)+((y)-(x))/2)
#define IN(x,a,b) ((a)<=(x)&&(x)<=(b))
#define cons make_pair
#define clamp(v,lo,hi) min(max(v,lo),hi)

template <typename T>
inline bool found(set<T> &s, T elem) { return s.find(elem) != s.end(); }
template <typename T>
inline bool found(unordered_set<T> &s, T elem) { return s.find(elem) != s.end(); }
template <typename T, typename U>
inline bool found(map<T,U> &s, U elem) { return s.find(elem) != s.end(); }
template <typename T, typename U>
inline bool found(unordered_map<T,U> &s, U elem) { return s.find(elem) != s.end(); }
template <typename T>
inline bool found(vector<T> &s, T elem) { return find(s.begin(), s.end(), elem) != s.end(); }
inline int found(string &s, string t) { return (int)s.find(t); }
inline int found(string &s, int c) { return (int)s.find(c); }

template<typename T1, typename T2> inline void amin(T1 & a, T2 const & b) { if (a>b) a=b; }
template<typename T1, typename T2> inline void amax(T1 & a, T2 const & b) { if (a<b) a=b; }
template<typename X, typename T> auto vectors(X x, T a) { return vector<T>(x, a); }
template<typename X, typename Y, typename Z, typename... Zs> auto vectors(X x, Y y, Z z, Zs... zs) { auto cont = vectors(y, z, zs...); return vector<decltype(cont)>(x, cont); }

inline ll square(ll x) { return x * x; }
inline ll gcd(ll a, ll b) { while(a) swap(a, b%=a); return b; }
template <typename T>
inline T mod(T a, T b) { return ((a % b) + b) % b; }

template <typename T>
int find_left(vector<T>& v, T elem) {
    return (int)(upper_bound(v.begin(), v.end(), elem) - v.begin()) - 1;
}
template <typename T>
int find_right(vector<T>& v, T elem) {
    return (int)(lower_bound(v.begin(), v.end(), elem) - v.begin());
}

bool _common(int W, int N, int x0, vi& u, vi& v) {
    int llim = 0, rlim = W;

    for (int i=N-1; i>=0; --i) {
        if (i < N-1) {
            if (v[i] == -1 && rlim < W) ++rlim;
            else if (v[i] == 1 && llim > 0) --llim;
        }

        if (u[i] == 1 && rlim > 0) --rlim;
        else if (u[i] == -1 && llim < W) ++llim;

        if (llim >= rlim) return false;
    }

    return IN(x0, llim, rlim-1);
}

bool _horiz(int W, int N, int sc, string& s,string& t) {
    vi u(N,0), v(N,0);
    rep(i,N){
        if (s[i]=='R') u[i]=1;
        else if (s[i]=='L') u[i]=-1;

        if (t[i]=='R') v[i]=1;
        else if (t[i]=='L') v[i]=-1;
    }
    return _common(W, N, sc-1, u, v);
}

bool _vert(int H, int N, int sr, string& s,string& t) {
    vi u(N,0), v(N,0);
    rep(i,N){
        if (s[i]=='D') u[i]=1;
        else if (s[i]=='U') u[i]=-1;

        if (t[i]=='D') v[i]=1;
        else if (t[i]=='U') v[i]=-1;
    }
    return _common(H, N, sr-1, u, v);
}

bool solve(int H,int W,int N, int sr,int sc, string& s,string& t) {
    return _horiz(W,N, sc, s,t) && _vert(H,N, sr, s,t);
}

int main() {
    int H,W,N; cin >> H >> W >> N;
    int sr,sc; cin >> sr >> sc;
    string s,t; cin >> s >> t;
    cout << (solve(H,W,N,sr,sc,s,t) ? "YES":"NO") << endl;
    return 0;
}


Measured memory_bytes: 2312