/*
これを入れて実行
g++ code.cpp
./a.out
 */
 
#include <iostream>
#include <stdio.h>
#include <vector>
#include <string>
#include <cstring>
#include <queue>
#include <deque>
#include <stack>
#include <algorithm>
#include <utility>
#include <set>
#include <map>
#include <unordered_map>
#include <cmath>
#include <math.h>
#include <tuple>
#include <iomanip>
#include <bitset>
#include <functional>
#include <cassert>

#define all(x) (x).begin(),(x).end()
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
 
using namespace std;
typedef long long ll;
typedef long double ld;
 
int dy4[4] = {-1, 0, +1, 0};
int dx4[4] = {0, +1, 0, -1};
int dy8[8] = {-1, -1, 0, 1, 1, 1, 0, -1};
int dx8[8] = {0, 1, 1, 1, 0, -1, -1, -1};
 
const long long INF = 1LL << 60;
const ll MOD = 1e9 + 7;
 
bool greaterSecond(const pair<int, int>& f, const pair<int, int>& s){
    return f.second > s.second;
}
 
ll gcd(ll a, ll b){
	if (b == 0)return a;
	return gcd(b, a % b);
}
 
ll lcm(ll a, ll b){
    return a / gcd(a, b) * b;
}

ll conbinationMemo[100][100];

void cmemoInit(){
    rep(i, 100){
        rep(j, 100){
            conbinationMemo[i][j] = -1;
        }
    }
}
 
ll nCr(ll n, ll r){
    if(conbinationMemo[n][r] != -1) return conbinationMemo[n][r];
    if(r == 0 || r == n){
        return 1;
    } else if(r == 1){
        return n;
    }
    return conbinationMemo[n][r] = (nCr(n - 1, r) + nCr(n - 1, r - 1));
}
 
ll nPr(ll n, ll r){
    r = n - r;
    ll ret = 1;
    for (ll i = n; i >= r + 1; i--) ret *= i;
    return ret;
}
//-----------------------ここから-----------
int main(void){
    ll h, w, n;
    cin >> h >> w >> n;
    ll sx, sy;
    cin >> sy >> sx;

    string s, t;
    cin >> s >> t;

    ll nowx = sx;
    ll nowy = sy;
    bool ok = false;
    rep(i, n){
        if(s[i] == 'R'){
            nowx++;
        } else if(s[i] == 'U'){
            nowy--;
        }
        if(nowx > w || nowy <= 0){
            ok = true;
            break;
        }
        if(t[i] == 'L'){
            if(nowx - 1 <= 0) continue;
            nowx--;
        } else if(t[i] == 'D'){
            if(nowy + 1 > h) continue;
            nowy++;
        }
    }

    nowx = sx;
    nowy = sy;

    rep(i, n){
        if(s[i] == 'R'){
            nowx++;
        } else if(s[i] == 'D'){
            nowy++;
        }
        if(nowx > w || nowy > h){
            ok = true;
            break;
        }
        if(t[i] == 'L'){
            if(nowx - 1 <= 0) continue;
            nowx--;
        } else if(t[i] == 'U'){
            if(nowy - 1 <= 0) continue;
            nowy--;
        }
    }

    nowx = sx;
    nowy = sy;

    rep(i, n){
        if(s[i] == 'L'){
            nowx--;
        } else if(s[i] == 'U'){
            nowy--;
        }
        if(nowx <= 0 || nowy <= 0){
            ok = true;
            break;
        }
        if(t[i] == 'R'){
            if(nowx + 1 > w) continue;
            nowx++;
        } else if(t[i] == 'D'){
            if(nowy + 1 > h) continue;
            nowy++;
        }
    }

    nowx = sx;
    nowy = sy;

    rep(i, n){
        if(s[i] == 'L'){
            nowx--;
        } else if(s[i] == 'D'){
            nowy++;
        }
        if(nowx <= 0 || nowy > h){
            ok = true;
            break;
        }
        if(t[i] == 'R'){
            if(nowx + 1 > w) continue;
            nowx++;
        } else if(t[i] == 'U'){
            if(nowx - 1 <= 0) continue;
            nowy--;
        }
    }

    if(ok){
        cout << "NO" << endl;
    } else {
        cout << "YES" << endl;
    }
}



Measured memory_bytes: 3904