text: #
  # Created on Sat Jan 01 2022
  #
  # The MIT License (MIT)
  # Copyright (c) 2022 Maatuq
  #
  # Permission is hereby granted, free of charge, to any person obtaining a copy of this software
  # and associated documentation files (the "Software"), to deal in the Software without restriction,
  # including without limitation the rights to use, copy, modify, merge, publish, distribute, sublicense,
  # and/or sell copies of the Software, and to permit persons to whom the Software is furnished to do so,
  # subject to the following conditions:
  #
  # The above copyright notice and this permission notice shall be included in all copies or substantial
  # portions of the Software.
  #
  # THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED
  # TO THE WARRANTIES OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL
  # THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT,
  # TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
  #
  from functools import lru_cache
  from typing import List
  
  
  class Solution:
      def minFallingPathSum(self, matrix: List[List[int]]) -> int:
  
          m = len(matrix)
          n = len(matrix[0])
  
          @lru_cache(maxsize=None)
          def dp(i, j):
              if j >= n or j < 0:
                  return float("inf")
              if i == m - 1:
                  return matrix[i][j]
  
              return matrix[i][j] + min(dp(i + 1, j), dp(i + 1, j + 1), dp(i + 1, j - 1))
  
          m_value = float("inf")
          for i in range(n):
              m_value = min(m_value, dp(0, i))
  
          return m_value
  
  
  solver = Solution()
  matrix = [[2, 1, 3], [6, 5, 4], [7, 8, 9]]
  matrix = [[-19, 57], [-40, -5]]
  print(solver.minFallingPathSum(matrix))
  