Problem:
Score : 600 points

Problem Statement

We have a rectangular grid of squares with H horizontal rows and W vertical columns. Let (i,j) denote the square at the i-th row from the top and the j-th column from the left.
On this grid, there is a piece, which is initially placed at square (s_r,s_c).

Takahashi and Aoki will play a game, where each player has a string of length N.
Takahashi's string is S, and Aoki's string is T. S and T both consist of four kinds of letters: L, R, U and D.

The game consists of N steps. The i-th step proceeds as follows:

First, Takahashi performs a move. He either moves the piece in the direction of S_i, or does not move the piece.

Second, Aoki performs a move. He either moves the piece in the direction of T_i, or does not move the piece.

Here, to move the piece in the direction of L, R, U and D, is to move the piece from square (r,c) to square (r,c-1), (r,c+1), (r-1,c) and (r+1,c), respectively. If the destination square does not exist, the piece is removed from the grid, and the game ends, even if less than N steps are done.

Takahashi wants to remove the piece from the grid in one of the N steps.
Aoki, on the other hand, wants to finish the N steps with the piece remaining on the grid.
Determine if the piece will remain on the grid at the end of the game when both players play optimally.

Constraints

2 \leq H,W \leq 2 \times 10^5

2 \leq N \leq 2 \times 10^5

1 \leq s_r \leq H

1 \leq s_c \leq W

|S|=|T|=N

S and T consists of the four kinds of letters L, R, U and D.

Input

Input is given from Standard Input in the following format:

H W N
s_r s_c
S
T

Output

If the piece will remain on the grid at the end of the game, print YES; otherwise, print NO.

Sample Input 1

2 3 3
2 2
RRL
LUD

Sample Output 1

YES

Here is one possible progress of the game:

Takahashi moves the piece right. The piece is now at (2,3).

Aoki moves the piece left. The piece is now at (2,2).

Takahashi does not move the piece. The piece remains at (2,2).

Aoki moves the piece up. The piece is now at (1,2).

Takahashi moves the piece left. The piece is now at (1,1).

Aoki does not move the piece. The piece remains at (1,1).

Sample Input 2

4 3 5
2 2
UDRRR
LLDUD

Sample Output 2

NO

Sample Input 3

5 6 11
2 1
RLDRRUDDLRL
URRDRLLDLRD

Sample Output 3

NO

Solution in Rust (1.15.1) (judge verdict: Wrong Answer)

#[allow(unused_imports)]
use std::cmp::*;
#[allow(unused_imports)]
use std::collections::*;

fn read<T: std::str::FromStr>() -> T {
    let mut s = String::new();
    std::io::stdin().read_line(&mut s).ok();
    s.trim().parse().ok().unwrap()
}

fn read_vec<T: std::str::FromStr>() -> Vec<T> {
    read::<String>()
        .split_whitespace()
        .map(|e| e.parse().ok().unwrap())
        .collect()
}

fn main() {
    let v: Vec<usize> = read_vec();
    let (h, w, n) = (v[0], v[1], v[2]);
    let v: Vec<i32> = read_vec();
    let (sr, sc) = (v[0] - 1, v[1] - 1);
    let s = read::<String>().chars().collect::<Vec<_>>();
    let t = read::<String>().chars().collect::<Vec<_>>();

    let mut r_que = BinaryHeap::new();
    let mut sr1 = sr;
    let mut r_use_timing = BTreeSet::new();
    for i in 0..n {
        if s[i] == 'R' {
            sr1 += 1;
            if sr1 >= w as i32 {
                if let Some(x) = r_que.pop() {
                    r_use_timing.insert(x);
                } else {
                    println!("NO");
                    return;
                }
            }
        }
        if t[i] == 'L' {
            r_que.push(i);
        }
    }
    let mut pointer = sr;
    for i in 0..n {
        if s[i] == 'R' {
            pointer += 1;
        }
        if r_use_timing.contains(&i) {
            pointer -= 1;
        }
        if pointer < 0 {
            println!("NO");
            return;
        }
    }

    let mut r_que = BinaryHeap::new();
    let mut sr1 = w as i32 - 1 - sr;
    let mut r_use_timing = BTreeSet::new();
    for i in 0..n {
        if s[i] == 'L' {
            sr1 += 1;
            if sr1 >= w as i32 {
                if let Some(x) = r_que.pop() {
                    r_use_timing.insert(x);
                } else {
                    println!("NO");
                    return;
                }
            }
        }
        if t[i] == 'R' {
            r_que.push(i);
        }
    }
    let mut pointer = sr;
    for i in 0..n {
        if s[i] == 'L' {
            pointer += 1;
        }
        if r_use_timing.contains(&i) {
            pointer -= 1;
        }
        if pointer < 0 {
            println!("NO");
            return;
        }
    }

    let mut r_que = BinaryHeap::new();
    let mut sr1 = sr;
    let mut r_use_timing = BTreeSet::new();
    for i in 0..n {
        if s[i] == 'D' {
            sr1 += 1;
            if sr1 >= h as i32 {
                if let Some(x) = r_que.pop() {
                    r_use_timing.insert(x);
                } else {
                    println!("NO");
                    return;
                }
            }
        }
        if t[i] == 'U' {
            r_que.push(i);
        }
    }
    let mut pointer = sr;
    for i in 0..n {
        if s[i] == 'D' {
            pointer += 1;
        }
        if r_use_timing.contains(&i) {
            pointer -= 1;
        }
        if pointer < 0 {
            println!("NO");
            return;
        }
    }

    let mut r_que = BinaryHeap::new();
    let mut sr1 = h as i32 - 1 - sr;
    let mut r_use_timing = BTreeSet::new();
    for i in 0..n {
        if s[i] == 'U' {
            sr1 += 1;
            if sr1 >= h as i32 {
                if let Some(x) = r_que.pop() {
                    r_use_timing.insert(x);
                } else {
                    println!("NO");
                    return;
                }
            }
        }
        if t[i] == 'D' {
            r_que.push(i);
        }
    }
    let mut pointer = sr;
    for i in 0..n {
        if s[i] == 'U' {
            pointer += 1;
        }
        if r_use_timing.contains(&i) {
            pointer -= 1;
        }
        if pointer < 0 {
            println!("NO");
            return;
        }
    }

    println!("YES");
}