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 copy
  import numpy as np
  
  H, W = map(int, input().split())
  A = np.array([[0 if a == "#" else 1 for a in input()] for _ in range(H)])
  
  
  def change_color(A):
      new_A = copy.deepcopy(A)
      for i, ai in enumerate(A):
          for j, aij in enumerate(ai):
              if aij == 0:
                  if i == H - 1 and j == W - 1:
                      new_A[i - 1][j] = 0
                      new_A[i][j - 1] = 0
                  elif i == H - 1:
                      if j == 0:
                          new_A[i - 1][j] = 0
                          new_A[i][j + 1] = 0
                      else:
                          new_A[i - 1][j] = 0
                          new_A[i][j - 1] = 0
                          new_A[i][j + 1] = 0
                  elif j == W - 1:
                      if i == 0:
                          new_A[i + 1][j] = 0
                          new_A[i][j - 1] = 0
                      else:
                          new_A[i - 1][j] = 0
                          new_A[i + 1][j] = 0
                          new_A[i][j - 1] = 0
                  else:
                      if i == 0:
                          new_A[i + 1][j] = 0
                          new_A[i][j - 1] = 0
                          new_A[i][j + 1] = 0
                      elif j == 0:
                          new_A[i - 1][j] = 0
                          new_A[i + 1][j] = 0
                          new_A[i][j + 1] = 0
                      else:
                          new_A[i - 1][j] = 0
                          new_A[i + 1][j] = 0
                          new_A[i][j - 1] = 0
                          new_A[i][j + 1] = 0
  
      return new_A
  
  
  count = 0
  
  while A.sum() != 0:
      A = change_color(A)
      count += 1
  
  print(count)
  
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"}]