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
  
  H, W, N = [int(x) for x in input().split(" ")]
  x = tuple([int(x) for x in input().split(" ")])
  # S = [x for x in input()]
  # T = [x for x in input()]
  S = input()
  T = input()
  
  
  class Takahashi:
      def __init__(self, S, H, W):
          self.s = S
          self.up = S.count("R")
          self.down = S.count("D")
          self.right = S.count("R")
          self.left = S.count("L")
  
          self.H = H
          self.W = W
  
      def __call__(self, i, s, aoki):
          if self.s[i] == "U":
              self.up -= 1
              if ((self.up - aoki.down - s[0]) - 1) > ((s[0] + self.down - aoki.up) - H):
                  return (s[0] - 1, s[1])
  
          elif self.s[i] == "D":
              self.down -= 1
              if ((self.up - aoki.down - s[0]) - 1) < ((s[0] + self.down - aoki.up) - H):
                  return (s[0] - 1, s[1])
  
          elif self.s[i] == "R":
              self.right -= 1
              if ((self.left - aoki.right - s[1]) - 1) < (
                  (s[1] + self.right - aoki.left) - W
              ):
                  return (s[0], s[1] + 1)
  
          elif self.s[i] == "L":
              self.left -= 1
              if ((self.left - aoki.right - s[1]) - 1) > (
                  (s[1] + self.right - aoki.left) - W
              ):
                  return (s[0], s[1] - 1)
  
          return s
  
  
  class Aoki:
      def __init__(self, T, H, W):
          self.t = T
          self.up = T.count("R")
          self.down = T.count("D")
          self.right = T.count("R")
          self.left = T.count("L")
  
          self.H = H
          self.W = W
  
      def __call__(self, i, s, takahashi):
          if self.t[i] == "U":
              self.up -= 1
              if ((takahashi.up - self.down - s[0]) - 1) < (
                  (s[0] + takahashi.down - self.up) - H
              ):
                  return (s[0] - 1, s[1])
  
          elif self.t[i] == "D":
              self.down -= 1
              if ((takahashi.up - self.down - s[0]) - 1) > (
                  (s[0] + takahashi.down - self.up) - H
              ):
                  return (s[0] - 1, s[1])
  
          elif self.t[i] == "R":
              self.right -= 1
              if ((takahashi.left - self.right - s[1]) - 1) > (
                  (s[1] + takahashi.right - self.left) - W
              ):
                  return (s[0], s[1] + 1)
  
          elif self.t[i] == "L":
              self.left -= 1
              if ((takahashi.left - self.right - s[1]) - 1) < (
                  (s[1] + takahashi.right - self.left) - W
              ):
                  return (s[0], s[1] - 1)
  
          return s
  
  
  takahashi = Takahashi(S, H, W)
  aoki = Aoki(T, H, W)
  
  for i in range(N):
      x = takahashi(i, x, aoki)
      if (x[0] < 1) or (x[0] > H) or (x[1] < 1) or (x[1] > W):
          print("NO")
          sys.exit()
      x = aoki(i, x, takahashi)
  
  print("YES")
  
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"}]