output_description: If the piece will remain on the grid at the end of the game, print `YES`;
  otherwise, print `NO`.
  
  * * *
input_description: Input is given from Standard Input in the following format:
  
      
      
      H W N
      s_r s_c
      S
      T
attempt: import sys
  
  input = sys.stdin.buffer.readline
  
  # sys.setrecursionlimit(10**9)
  # from functools import lru_cache
  
  
  def RD():
      return input().rstrip().decode()
  
  
  def II():
      return int(input())
  
  
  def FI():
      return float(input())
  
  
  def MI():
      return map(int, input().split())
  
  
  def MF():
      return map(float, input().split())
  
  
  def LI():
      return list(map(int, input().split()))
  
  
  def LF():
      return list(map(float, input().split()))
  
  
  def TI():
      return tuple(map(int, input().split()))
  
  
  # rstrip().decode()
  
  
  def main():
      h, w, n = MI()
      sr, sc = MI()
      S = RD()
      T = RD()
  
      ans = "YES"
  
      # Rの検証
      x = w - sc + 1
      for i, j in zip(S, T):
          if i == "R":
              x -= 1
              if x == 0:
                  ans = "NO"
          if j == "L":
              if x < w:
                  x += 1
  
      # Lの検証
      x = sc
      for i, j in zip(S, T):
          if i == "L":
              x -= 1
              if x == 0:
                  ans = "NO"
          if j == "R":
              if x < w:
                  x += 1
  
      # Dの検証
      x = h - sr + 1
      for i, j in zip(S, T):
          if i == "D":
              x -= 1
              if x == 0:
                  ans = "NO"
          if j == "U":
              if x < h:
                  x += 1
  
      # Uの検証
      x = sr
      for i, j in zip(S, T):
          if i == "U":
              x -= 1
              if x == 0:
                  ans = "NO"
          if j == "D":
              if x < h:
                  x += 1
  
      print(ans)
  
  
  if __name__ == "__main__":
      main()
  
problem_description: 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.
samples: [{"input": "2 3 3\n    2 2\n    RRL\n    LUD", "output": "YES\n    \n\nHere is one possible progress of the game:\n\n  * Takahashi moves the piece right. The piece is now at (2,3).\n  * Aoki moves the piece left. The piece is now at (2,2).\n  * Takahashi does not move the piece. The piece remains at (2,2).\n  * Aoki moves the piece up. The piece is now at (1,2).\n  * Takahashi moves the piece left. The piece is now at (1,1).\n  * Aoki does not move the piece. The piece remains at (1,1).\n\n* * *"}, {"input": "4 3 5\n    2 2\n    UDRRR\n    LLDUD", "output": "NO\n    \n\n* * *"}, {"input": "5 6 11\n    2 1\n    RLDRRUDDLRL\n    URRDRLLDLRD", "output": "NO"}]