def max_path_sum(tri, m, n):
    if not tri or m <= 0 or n <= 0:
        return 0

    rows = min(m, len(tri))
    dp = [0] * rows

    first_row = tri[0]
    if not first_row:
        return 0
    dp[0] = first_row[0]

    for i in range(1, rows):
        row = tri[i]
        width = min(i + 1, len(row), n)
        if width <= 0:
            continue

        new_dp = [0] * rows
        new_dp[0] = dp[0] + row[0]

        for j in range(1, width - 1):
            new_dp[j] = max(dp[j - 1], dp[j]) + row[j]

        if width > 1:
            new_dp[width - 1] = dp[width - 2] + row[width - 1]

        dp = new_dp

    last_width = min(rows, len(tri[rows - 1]), n)
    return max(dp[:last_width]) if last_width > 0 else 0