def get_maxgold(gold, m, n):
    # dp[i][j] = max gold collectible starting from cell (i, j)
    dp = [[0] * n for _ in range(m)]
    
    # Fill from right to left
    for col in range(n - 1, -1, -1):
        for row in range(m):
            # Gold collected from right neighbor
            right = dp[row][col + 1] if col + 1 < n else 0
            # Gold collected from upper-right neighbor
            upper_right = dp[row - 1][col + 1] if col + 1 < n and row - 1 >= 0 else 0
            # Gold collected from lower-right neighbor
            lower_right = dp[row + 1][col + 1] if col + 1 < n and row + 1 < m else 0
            
            dp[row][col] = gold[row][col] + max(right, upper_right, lower_right)
    
    # The answer is the maximum value in the first column
    return max(dp[row][0] for row in range(m))