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: def solve(W, sc, chL, chR):
      limLs, limRs = [0] * N, [0] * N
      limL, limR = 0, W + 1
      for i in reversed(range(N)):
          if Ts[i] == chL:
              limR += 1
              if limR > W + 1:
                  limR = W + 1
          elif Ts[i] == chR:
              limL -= 1
              if limL < 0:
                  limL = 0
          if Ss[i] == chL:
              limL += 1
              if limL > W + 1:
                  limL = W + 1
          elif Ss[i] == chR:
              limR -= 1
              if limR < 0:
                  limR = 0
          limLs[i] = limL
          limRs[i] = limR
  
      posL, posR = sc, sc
      for i in range(N):
          if posR <= limLs[i] or limRs[i] <= posL:
              return False
          if Ss[i] == chL:
              posR -= 1
              if posR < 1:
                  posR = 1
          elif Ss[i] == chR:
              posL += 1
              if posL > W:
                  posL = W
          if Ts[i] == chL:
              posL -= 1
              if posL < 1:
                  posL = 1
          elif Ts[i] == chR:
              posR += 1
              if posR > W:
                  posR = W
  
      return True
  
  
  H, W, N = map(int, input().split())
  sr, sc = map(int, input().split())
  Ss = input()
  Ts = input()
  
  ansLR = solve(W, sc, "L", "R")
  ansUD = solve(H, sr, "U", "D")
  
  print("YES" if ansLR and ansUD else "NO")
  
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"}]