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: H, W, N = tuple(map(int, input().split()))
  
  r, c = tuple(map(int, input().split()))
  
  Ta = input()
  Ao = input()
  
  
  def convert(ch):
      if ch == "R":
          return (0, 1)
      elif ch == "L":
          return (0, -1)
      elif ch == "U":
          return (1, 0)
      else:
          return (-1, 0)
  
  
  # 青木くんのターンになったらやばいマップを逆方向に1動かして重ねた部分がやばくなる
  import numpy as np
  
  yabaiMap = np.zeros((H + 2, W + 2))
  yabaiMap[1:-1, 1:-1] = np.ones((H, W))
  
  for idx, (t, a) in enumerate(zip(reversed(Ta), reversed(Ao))):
      if idx != 0:
  
          dy, dx = convert(a)
          # 動かした方向にやばくない場所があれば復帰する
          # つまり フィルタをかけてしまえばいいので，元の場所が0かつ動かした先が1であればよい，その場所を1にする
          yabaiMap[1:-1, 1:-1] += (1 - yabaiMap)[1:-1, 1:-1] * yabaiMap[
              1 + dy : H + 1 + dy, 1 + dx : W + 1 + dx
          ]
          # print("A",a,yabaiMap)
      dy, dx = convert(t)
      yabaiMap[1:-1, 1:-1] *= yabaiMap[1 + dy : H + 1 + dy, 1 + dx : W + 1 + dx]
      if np.sum(yabaiMap) == 0:
          print("NO")
          quit()
  print("YES" if yabaiMap[r, c] == 1 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"}]