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: from collections import defaultdict
  
  s_dict = defaultdict(lambda: 0)
  t_dict = defaultdict(lambda: 0)
  
  h, w, n = map(int, input().split())
  sr, sc = map(int, input().split())
  s = list(str(input()))
  t = list(str(input()))
  
  for i in range(n):
      s_dict[s[i]] += 1
      t_dict[t[i]] += 1
  
  # 落ちるパターン
  # 駒が端にあり、高橋くんが場外に移動させることができる場合、落ちる
  ans = "NO"
  first = False
  if (
      sr == 1
      and s_dict["L"] > 0
      or sr == w
      and s_dict["R"] > 0
      or sc == 1
      and s_dict["U"] > 0
      or sc == h
      and s_dict["D"] > 0
  ):
      first = True
  
  s_sum = defaultdict(lambda: 0)
  t_sum = defaultdict(lambda: 0)
  if not first:
      # それぞれの累積和でmaxを考える
      for i in range(n):
          s_sum[s[i]] += 1
          # 高橋くんは落とさないようにする制約がある
          if t[i] == "L" and t_sum["L"] - s_sum["R"] >= sr - 1:
              pass
          elif t[i] == "R" and t_sum["R"] - s_sum["L"] >= w - sr:
              pass
          elif t[i] == "U" and t_sum["U"] - s_sum["D"] >= sc - 1:
              pass
          elif t[i] == "D" and t_sum["D"] - s_sum["U"] >= h - sc:
              pass
          else:
              t_sum[t[i]] += 1
  
          if sr <= s_sum["L"] - t_sum["R"]:
              break
          elif w - sr < s_sum["R"] - t_sum["L"]:
              break
          elif sc <= s_sum["U"] - t_sum["D"]:
              break
          elif h - sc < s_sum["D"] - t_sum["U"]:
              break
          if i == n - 1:
              ans = "YES"
  print(ans)
  
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"}]