output_description: Print a way to paint the squares satisfying the condition, in the following
  format. If the square (i,\ j) is painted in red, yellow, green or blue, c_{ij}
  should be `R`, `Y`, `G` or `B`, respectively.
  
      
      
      c_{11}c_{12}...c_{1W}
      :
      c_{H1}c_{H2}...c_{HW}
      
  
  * * *
input_description: Input is given from Standard Input in the following format:
  
      
      
      H W d
attempt: def ok(x, y):
      return (0 <= x < h) and (0 <= y < w)
  
  
  a = input().split()
  h = int(a[0])
  w = int(a[1])
  d = int(a[2])
  state = []
  ans = []
  for i in range(h):
      temp1 = []
      temp2 = []
      for j in range(w):
          temp1.append(15)
          temp2.append("X")
      state.append(temp1)
      ans.append(temp2)
  # state[h][w]
  for i in range(h):
      for j in range(w):
          if (state[i][j] & 1) != 0:
              ans[i][j] = "R"
              for x in range(i - d, i + d + 1):
                  y = j + (d - abs(i - x))
                  if ok(x, y):
                      state[x][y] &= ~1
                  y = j - (d - abs(i - x))
                  if ok(x, y):
                      state[x][y] &= ~1
          elif (state[i][j] & 2) != 0:
              ans[i][j] = "Y"
              for x in range(i - d, i + d + 1):
                  y = j + (d - abs(i - x))
                  if ok(x, y):
                      state[x][y] &= ~2
                  y = j - (d - abs(i - x))
                  if ok(x, y):
                      state[x][y] &= ~2
          elif (state[i][j] & 4) != 0:
              ans[i][j] = "G"
              for x in range(i - d, i + d + 1):
                  y = j + (d - abs(i - x))
                  if ok(x, y):
                      state[x][y] &= ~4
                  y = j - (d - abs(i - x))
                  if ok(x, y):
                      state[x][y] &= ~4
          elif (state[i][j] & 8) != 0:
              ans[i][j] = "B"
              for x in range(i - d, i + d + 1):
                  y = j + (d - abs(i - x))
                  if ok(x, y):
                      state[x][y] &= ~8
                  y = j - (d - abs(i - x))
                  if ok(x, y):
                      state[x][y] &= ~8
          else:
              ans[i][j] = "Z"
  for i in range(h):
      for j in range(w):
          print(ans[i][j], end="")
      print()
  
problem_description: Statement
  
  We have a grid with H rows and W columns of squares. We will represent the
  square at the i-th row from the top and j-th column from the left as (i,\ j).
  Also, we will define the distance between the squares (i_1,\ j_1) and (i_2,\
  j_2) as |i_1 - i_2| + |j_1 - j_2|.
  
  Snuke is painting each square in red, yellow, green or blue. Here, for a given
  positive integer d, he wants to satisfy the following condition:
  
    * No two squares with distance exactly d have the same color.
  
  Find a way to paint the squares satisfying the condition. It can be shown that
  a solution always exists.
samples: [{"input": "2 2 1", "output": "RY\n    GR\n    \n\nThere are four pairs of squares with distance exactly 1. As shown below, no\ntwo such squares have the same color.\n\n  * (1,\\ 1), (1,\\ 2) : `R`, `Y`\n  * (1,\\ 2), (2,\\ 2) : `Y`, `R`\n  * (2,\\ 2), (2,\\ 1) : `R`, `G`\n  * (2,\\ 1), (1,\\ 1) : `G`, `R`\n\n* * *"}, {"input": "2 3 2", "output": "RYB\n    RGB\n    \n\nThere are six pairs of squares with distance exactly 2. As shown below, no two\nsuch squares have the same color.\n\n  * (1,\\ 1) , (1,\\ 3) : `R` , `B`\n  * (1,\\ 3) , (2,\\ 2) : `B` , `G`\n  * (2,\\ 2) , (1,\\ 1) : `G` , `R`\n  * (2,\\ 1) , (2,\\ 3) : `R` , `B`\n  * (2,\\ 3) , (1,\\ 2) : `B` , `Y`\n  * (1,\\ 2) , (2,\\ 1) : `Y` , `R`"}]