```python
def get_maxgold(gold, m, n):
    if m == 0 or n == 0:
        return 0

    dp_table = [[0 for _ in range(n)] for _ in range(m)]

    for j in range(n):
        for i in range(m):
            if j == 0:
                dp_table[i][j] = gold[i][j]
            else:
                # From directly left
                left = dp_table[i][j-1]
                
                # From diagonally up-left
                up_left = dp_table[i-1][j-1] if i > 0 else 0
                
                # From diagonally down-left
                down_left = dp_table[i+1][j-1] if i < m - 1 else 0
                
                dp_table[i][j] = gold[i][j] + max(left, up_left, down_left)

    # The result is the maximum value in the last column
    max_gold = 0
    if n > 0:
        max_gold = max(dp_table[i][n-1] for i in range(m))
        
    return max_gold
```